Method for processing counts when an end node is encountered

• US 20080275842A1
• Filed: 03/20/2006
• Published: 11/06/2008
• Est. Priority Date: 03/20/2006
• Status: Abandoned Application

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: Claar, Jane Van Keuren, Mazzagatti, Jane Campbell
• Application Number:
  US11/384,704
• Publication Number:
  US 20080275842A1
• Time in Patent Office: Days
• US Class Current: 707/3
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees

Abstract

A method for processing a particle stream in a KStore having a current sequence of nodes includes receiving at least one particle within the particle stream to provide a received particle and determining whether the current sequence is complete in accordance with the received particle to provide a sequence complete determination. Processing a completed sequence indicator in accordance with the sequence complete determination is also set forth. A determination is made whether the received particle is a delimiter to provide a delimiter determination and a received delimiter. A determination is made whether a Result node of an asCase node of the current K node matches the received delimiter to provide a match determination. A new K node is created in accordance with the match determination. The new K node can be an end product node. The current K node is set to the end product node.

Claims

1. A method for processing a particle stream in a KStore having a current sequence of nodes, comprising:

receiving at least one particle within said particle stream to provide a received particle to query or to update said KStore, said KStore comprising an interlocking trees datastore, said interlocking trees datastore comprising a plurality of nodes, wherein a K node of said plurality of nodes comprises a Case pointer and a Result pointer, said Case pointer and said Result pointer pointing to two nodes from which said K node is formed said K node also comprising pointers to an asCase array and an asResult array, said asCase array comprising pointers to nodes whose Case pointers point to said K node and wherein said asResult array comprises pointers to nodes whose Result pointers point to said K node;

determining whether said current sequence is complete in accordance with said received particle to provide a sequence complete determination; and

processing a completed sequence indicator in accordance with said sequence complete determination.

2. The method for processing a particle stream in a KStore of claim 1, further comprising determining whether said received particle is a delimiter to provide a delimiter determination and a received delimiter.

3. The method for processing a particle stream in a KStore of claim 2, wherein said current sequence has a current K node further comprising determining whether a Result node of an asCase node of said current K node matches said received delimiter to provide a match determination.

4. The method for processing a particle stream in a KStore of claim 3, further comprising creating a new K node in accordance with said match determination.

5. The method for processing a particle stream in a KStore of claim 4, wherein said new K node comprises an end product node.

6. The method for processing a particle stream in a KStore of claim 5, further comprising setting said current K node to said end product node.

7. The method for processing a particle stream in a KStore of claim 3, further comprising setting said current K node to a matched node in accordance with said match determination.

8. The method for processing a particle stream in a KStore of claim 2, further comprising incrementing a K node count in accordance with said delimiter determination.

9. The method for processing a particle stream in a KStore of claim 8, further comprising incrementing a plurality of K node counts in accordance with said delimiter determination.

10. The method for processing a particle stream in a KStore of claim 9, further comprising incrementing the K node counts of said plurality of node counts as a set in accordance with said delimiter determination.

11. The method for processing a particle stream in a KStore of claim 3, further comprising determining whether said KStore includes any levels higher than a first level to provide a higher level determination.

12. The method for processing a particle stream in a KStore of claim 11, further comprising creating a new subcomponent node in accordance with said higher level determination.

13. The method for processing a particle stream in a KStore of claim 11, further comprising setting a higher level current K node in accordance with said higher level determination.

14. The method for processing a particle stream in a KStore of claim 1, further comprising traversing said sequence.

15. The method for processing a particle stream in a KStore of claim 1, further comprising traversing said sequence across multiple K levels.

16. The method for processing a particle stream in a KStore of claim 14, further comprising traversing said sequence to a sequence beginning location.

17. The method for processing a particle stream in a KStore of claim 16, wherein said sequence beginning location comprises a beginning of thought node.

18. The method for processing a particle stream in a KStore of claim 16, further comprising traversing said sequence from said sequence beginning location to an end product node.

19. The method for processing a particle stream in a KStore of claim 16, further comprising updating a completed sequence indicator while traversing said sequence.

20. The method for processing a particle stream in a KStore of claim 19, further comprising updating said completed sequence indicator while traversing said sequence from said sequence beginning location to an end product node.

21. The method for processing a particle stream in a KStore of claim 19, wherein said completed sequence indicator is located within each node along said sequence.

22. The method for processing a particle stream in a KStore of claim 20, wherein said completed sequence indicator is located within said end product node.

23. The method for processing a particle stream in a KStore of claim 20, further comprising updating said completed sequence indicator when said completed sequence indicator is a node count.

24. The method for processing a particle stream in a KStore of claim 16, further comprising incrementing node counts while traversing said sequence.

25. The method for processing a particle stream in a KStore of claim 24, further comprising incrementing said node counts while traversing said sequence from said sequence beginning location to an end product node.

26. The method for processing a particle stream in a KStore of claim 24, further comprising incrementing said node counts while traversing said sequence.

27. The method for processing a particle stream in a KStore of claim 14, further comprising updating said completed sequence indicator while traversing said sequence.

28. The method for processing a particle stream in a KStore of claim 1, further comprising updating said completed sequence indicator of said K nodes in accordance with a called procedure.

29. The method for processing a particle stream in a KStore of claim 28, further comprising incrementing K node counts of said K nodes as completed sequence indicators in accordance with a called procedure.

30. The method for processing a particle stream in a KStore of claim 28, wherein said called procedure is called in response to a delimiter.

31. The method for processing a particle stream in a KStore of claim 28, wherein said called procedure is called by a KStore utility.

32. The method for processing a particle stream in a KStore of claim 31, wherein said KStore utility comprises a learn procedure.

33. The method for processing a particle stream in a KStore of claim 31, wherein said KStore utility comprises an application programming interface.

34. The method for processing a particle stream in a KStore of claim 2, wherein said delimiter determination is performed in accordance with a delimiter list.

35. The method for processing a particle stream in a KStore of claim 34, wherein said delimiter determination is performed in accordance with a state data structure.

36. The method for processing a particle stream in a KStore of claim 1, further comprising determining a K node count of a node in said sequence to provide a node count determination.

37. The method for processing a particle stream in a KStore of claim 36, further comprising determining whether said sequence is a partial sequence in accordance with said node count determination.

38. The method for processing a particle stream in a KStore of claim 36, further comprising determining that said sequence is a partial sequence when said node count determination is zero.

39. The method for processing a particle stream in a KStore of claim 1, further comprising an additional field within an end product node for indicating a completed sequence.

40. The method for processing a particle stream in a KStore of claim 1, wherein a node of said KStore is provided with a count field further comprising an additional field within said node for indicating a completed sequence.

41. The method for processing a particle stream in a KStore of claim 39, further comprising updating said completed sequence indicator of said end product nodes to indicate a completed sequence in accordance with a received delimiter.

42. The method for processing a particle stream in a KStore of claim 6, further comprising an additional field within an end product node for indicating a completed sequence.

43. The method for processing a particle stream in a KStore of claim 42, further comprising updating said completed sequence indicator of said end product node to indicate a completed sequence in accordance with a received delimiter.