Method for processing an input particle stream for creating lower levels of a KStore

• US 20070220069A1
• Filed: 03/20/2006
• Published: 09/20/2007
• Est. Priority Date: 03/20/2006
• Status: Abandoned Application

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: Claar, Jane, Mazzagatti, Jane
• Application Number:
  US11/384,664
• Publication Number:
  US 20070220069A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees

Abstract

A method for completing an incomplete sequence in a KStore having a plurality of KStore levels and a particle stream, the particle stream having a plurality of particles including at least one delimiter includes receiving the at least one delimiter within the particle stream to provide a received delimiter and determining a delimiter level in accordance with the received delimiter. Completing any incomplete KStore levels from a lowest incomplete level up through the delimiter level is also set forth. The KStore is provided with a list of defined delimiters and the list is stored in a defined delimiter data structure. A determination is made whether the received delimiter is stored in the defined delimiter data structure to provide a received delimiter determination. The KStore has a plurality of delimiters and the defined delimiter data structure includes a correspondence between the defined delimiters and the KStore levels.

Claims

1. A method for completing an incomplete sequence in a KStore having a plurality of KStore levels and a particle stream, said particle stream having a plurality of particles including at least one delimiter, comprising:

receiving said at least one delimiter within said particle stream to provide a received delimiter;

determining a delimiter level in accordance with said received delimiter; and

completing any incomplete KStore levels from a lowest incomplete level up through said delimiter level.

2. The method for completing an incomplete sequence in a KStore of claim 1, wherein said KStore is provided with a list of defined delimiters.

3. The method for completing an incomplete sequence in a KStore of claim 2, wherein said list is stored in a defined delimiter data structure.

4. The method for completing an incomplete sequence in a KStore of claim 3, further comprising determining whether said received delimiter is stored in said defined delimiter data structure to provide a received delimiter determination.

5. The method for completing an incomplete sequence in a KStore of claim 3, wherein said KStore has a plurality of delimiters and said defined delimiter data structure comprises a correspondence between said defined delimiters and said KStore levels.

6. The method for completing an incomplete sequence in a KStore of claim 5, further comprising determining a selected delimiter in accordance with said correspondence and said selected delimiter level.

7. The method for completing an incomplete sequence in a KStore of claim 5, further comprising determining a delimiter level in accordance with said correspondence and said delimiter determination.

8. The method for completing an incomplete sequence in a KStore of claim 3, wherein said defined delimiter data structure is stored in a state structure.

9. The method for completing an incomplete sequence in a KStore of claim 3, wherein said defined delimiter data structure maintains a hierarchical correspondence between the various levels of the KStore.

10. The method for completing an incomplete sequence in a KStore of claim 7, further comprising determining said lowest level in accordance with said hierarchical correspondence.

11. The method for completing an incomplete sequence in a KStore of claim 1, wherein said lowest incomplete level comprises an incomplete level closest to a sensor level.

12. The method for completing an incomplete sequence in a KStore of claim 1, further comprising:

determining that a selected KStore level is said lowest incomplete level in accordance with a partial sequence determination to provide a lowest level determination; and

completing said selected KStore level in accordance with said lowest level determination.

13. The method for completing an incomplete sequence in a KStore of claim 12, further comprising completing at least one incomplete level above said selected level.

14. The method for completing an incomplete sequence in a KStore of claim 13, further comprising completing any incomplete levels above said selected level.

15. The method for completing an incomplete sequence in a KStore of claim 13, further comprising determining a current K location for said selected level in accordance with said selected level.

16. The method for completing an incomplete sequence in a KStore of claim 1, wherein said KStore levels have respective current K nodes indicating partial sequence locations further comprising a state data structure for storing a correspondence between said KStore levels and said current K nodes.

17. The method for completing an incomplete sequence in a KStore of claim 16, further comprising determining said lowest incomplete level in accordance with said state data structure.

18. The method for completing an incomplete sequence in a KStore of claim 1, wherein a hierarchical correspondence between said KStore levels is provided, further comprising a hierarchical data structure for storing said correspondence.

19. The method for completing an incomplete sequence in a KStore of claim 18, further comprising determining said lowest incomplete level in accordance with said hierarchical data structure.

20. The method for completing an incomplete sequence in a KStore of claim 18, wherein said hierarchical data structure comprises a delimiter data structure.

21. The method for completing an incomplete sequence in a KStore of claim 18, wherein said hierarchical data structure is contained in a state data structure.

22. The method for completing an incomplete sequence in a KStore of claim 1, further comprising comparing a selected delimiter with a Result node of an asCase node of a current K node on a selected level to provide a matched delimiter determination.

23. The method for completing an incomplete sequence in a KStore of claim 22, further comprising creating a new end product node in accordance with said matched delimiter determination.

24. The method for completing an incomplete sequence in a KStore of claim 23, wherein said new end product node has a delimiter of said selected level as its Result node.

25. The method for completing an incomplete sequence in a KStore of claim 22, further comprising incrementing a node count.

26. The method for completing an incomplete sequence in a KStore of claim 22, further comprising determining whether said KStore has any levels higher than said selected level to provide an upper level determination.

27. The method for completing an incomplete sequence in a KStore of claim 26, further comprising comparing a Result node of an asCase node of a current K node on said upper level with an end product node of said selected level in accordance with said upper level determination to provide a upper level match determination.

28. The method for completing an incomplete sequence in a KStore of claim 27, further comprising creating a new subcomponent node in accordance with said upper level match determination.

29. The method for completing an incomplete sequence in a KStore of claim 27, further comprising setting an upper level current K node.

30. The method for completing an incomplete sequence in a KStore of claim 27, further comprising incrementing a node count.

31. The method for completing an incomplete sequence in a KStore of claim 22, further comprising setting a selected level current K node to a sequence beginning location.

32. The method for completing an incomplete sequence in a KStore of claim 22, further comprising repeating the operations of claim 22 for any remaining upper levels of said KStore.

33. The method for completing an incomplete sequence in a KStore of claim 12, further comprising determining whether a current K node of a selected KStore level is a sequence beginning location to provide an incomplete level determination.

34. The method for completing an incomplete sequence in a KStore of claim 33, further comprising determining that said selected KStore level is said lowest incomplete level in accordance with said incomplete level determination.

35. The method for completing an incomplete sequence in a KStore of claim 33, wherein said sequence beginning location comprises a BOT node.

36. The method for completing an incomplete sequence in a KStore of claim 33, further comprising completing said selected level in accordance with said incomplete level determination.

37. The method for completing an incomplete sequence in a KStore of claim 36, further comprising completing at least one incomplete level above said selected level.

38. The method for completing an incomplete sequence in a KStore of claim 37, further comprising completing any incomplete levels above said selected level through the received delimiter level.

39. The method for completing an incomplete sequence in a KStore of claim 1, wherein said current K node has an adjacent K node that is adjacent to said current K node further comprising locating said adjacent node in accordance with an asCase list of said current K node to provide a located asCase node.

40. The method for completing an incomplete sequence in a KStore of claim 39, wherein said asCase list includes a plurality of asCase nodes further comprising locating a plurality of adjacent nodes in accordance with said asCase list.

41. The method for completing an incomplete sequence in a KStore of claim 39, wherein a learn function of said KStore is disabled further comprising performing no build operations if no adjacent node of said plurality of adjacent nodes has a Result node that matches said selected delimiter.

42. The method for completing an incomplete sequence in a KStore of claim 39, wherein said determining further comprises determining a Result node of said located asCase node to provide a determined Result node.

43. The method for completing an incomplete sequence in a KStore of claim 42, further comprising comparing said determined Result node with a selected delimiter to provide a match determination.

44. The method for completing an incomplete sequence in a KStore of claim 43, further comprising determining said delimiter level in accordance with said match determination.

45. The method for completing an incomplete sequence in a KStore of claim 43, further comprising determining said lowest incomplete level in accordance with a sequence beginning location determination.

46. The method for completing an incomplete sequence in a KStore of claim 45, further comprising completing at least one incomplete level above said lowest incomplete level.

47. The method for completing an incomplete sequence in a KStore of claim 46, further comprising completing any incomplete levels above said selected level up through said determined delimiter level.