Method for processing K node count fields using an intensity variable

• US 8,516,004 B2
• Filed: 03/20/2006
• Issued: 08/20/2013
• Est. Priority Date: 09/19/2003
• Status: Expired due to Fees

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: Mazzagatti, Jane Campbell
• Primary Examiner(s): Ehichioya, Fred I
• Assistant Examiner(s): OWYANG, MICHELLE N
• Application Number:
  US11/384,777
• Publication Number:
  US 20070219975A1
• Time in Patent Office: 2,710 Days
• Field of Search: 707790-811
• US Class Current: 707/797
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees

Abstract

In a KStore having K nodes with respective K node counts a method for updating the K node counts includes processing a K node in accordance with a received particle to provide a processed K node and updating a node count in response to the processing. The processing of the processed K node includes building the processed K node in response to the received particle. A node count of a beginning of sequence node is updated. A beginning of sequence node includes a beginning of thought node. The received particle can be a particle of sensor data having a corresponding sensor node to provide a sensor node determination. A node count of the corresponding sensor node is updated in response to the sensor node determination. A subcomponent node is determined in response to the sensor determination and a K node count of the subcomponent node is updated.

Claims

1. In a KStore having a plurality of K nodes with a plurality of respective K node counts, a method for updating said K node counts of said plurality of respective K node counts, comprising:

processing a K node of said plurality of K nodes of said KStore, comprising elemental K nodes representing particles of data; and

updating a K node count in response to said processing;

wherein each K node of the plurality of K nodes comprises a Case pointer and a Result pointer;

said Case pointer and said Result pointer pointing to two K 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 K nodes whose Case pointers point to said K node; and

said asResult array comprises pointers to K nodes whose Result pointers point to said K node in accordance with a received particle to provide a processed K node; and

said KStore comprises a set of interlocking trees comprising a multi-rooted tree of asCase branches forming an asCase tree depending from a first root and asResult branches forming multiple asResult trees depending from multiple roots, wherein an asResult tree comprising a second root node link to an end product leaf node of the asCase tree accesses the branches of the asCase tree terminating in the end products, in inverted order.

2. The method for updating said K node counts of said plurality of respective K node counts of claim 1, wherein said processing of said processed K node comprises building said processed K node in response to said received particle.

3. The method for updating said K node counts of said plurality of respective K node counts of claim 1, comprising updating a K node count of a beginning of sequence node.

4. The method for updating said K node counts of said plurality of respective K node counts of claim 3, wherein a beginning of sequence K node comprises a beginning of thought K node.

5. The method for updating said K node counts of said plurality of respective K node counts of claim 1, further comprising determining that said received particle is a particle of sensor data having a corresponding sensor node to provide a sensor node determination.

6. The method for updating said K node counts of said plurality of respective K node counts of claim 3, further comprising updating a K node count of said corresponding sensor node in response to said sensor node determination.

7. The method for updating said K node counts of said plurality of respective K node counts of claim 3, further comprising determining a subcomponent node in response to said sensor determination;

and updating a K node count of said subcomponent node.

8. The method for updating said K node counts of said plurality of respective K node counts of claim 7, further comprising comparing a Result node of an asCase node of a current K node with said sensor node to provide a processed subcomponent node determination.

9. The method for updating said K node counts of said plurality of respective K node counts of claim 1, further comprising determining that said received particle is a delimiter particle to provide a delimiter determination.

10. The method for updating said K node counts of said plurality of respective K node counts of claim 9, further comprising:

determining an end product node in response to said delimiter determination; and

updating a K node count of said end product node.

11. The method for updating said K node counts of said plurality of respective K node counts of claim 9, wherein said KStore has a plurality of levels including a current level and at least one lower level below said current level further comprising determining a lower level delimiter in response to said delimiter determination to provide a lower level delimiter determination.

12. The method for updating said K node counts of said plurality of respective K node counts of claim 11, further comprising:

determining an end product node in response to said lower level delimiter determination; and

updating a K node count of said end product node.

13. The method for updating said K node counts of said plurality of respective K node counts of claim 10, wherein said KStore has a plurality of levels including a current level and at least one higher level above said current level further comprising:

determining a further K node on said at least one higher level; and

updating a K node count of said further K node.

14. The method for updating said K node counts of said plurality of respective K node counts of claim 2, wherein said building comprises a learn operation.

15. The method for updating said K node counts of said plurality of respective K node counts of claim 1, wherein said updating occurs in accordance with a learn determination.

16. The method for updating said K node counts of said plurality of respective K node counts of claim 15, wherein said updating of a K node count is performed in accordance with a learn type.

17. The method for updating said K node counts of said plurality of respective K node counts of claim 1, wherein said updating is performed in accordance with a query determination.

18. The method for updating said K node counts of said plurality of respective K node counts of claim 1, wherein said experiencing of said processed K node comprises traversing said processed K node.

19. The method for updating said K node counts of said plurality of respective K node counts of claim 1, wherein said updating comprises adding an intensity value to said K node count.

20. The method for updating said K node counts of said plurality of respective K node counts of claim 19, wherein said intensity value is equal to one.

21. The method for updating said K node counts of said plurality of respective K node counts of claim 19, wherein said intensity value is not equal to one.

22. The method for updating said K node counts of said plurality of respective K node counts of claim 21, wherein said intensity value is greater than one.

23. The method for updating said K node counts of said plurality of respective K node counts of claim 19, wherein said intensity value is negative.

24. The method for updating said K node counts of said plurality of respective K node counts of claim 19, wherein said K node count is reduced to a low value.

25. The method for updating said K node counts of said plurality of respective K node counts of claim 24, wherein said K node is removed from said KStore in accordance with said low value.

26. The method for updating said K node counts of said plurality of respective K node counts of claim 24, wherein said K node is maintained within said KStore to provide a history.

27. The method for updating said K node counts of said plurality of respective K node counts of claim 19, wherein said intensity value is zero.

28. The method for updating said K node counts of said plurality of respective K node counts of claim 19, wherein said KStore is provided with a plurality of sequences for transmission to said KStore and for learning of said sequences into said KStore comprising:

determining a plurality of identical sequences;

determining a number of times an identical sequence of said plurality of identical sequences occurs; and

determining said intensity value in accordance with said number of times said identical sequence occurs to provide a multi sequence intensity value.

29. The method for updating said K node counts of said plurality of respective K node counts of claim 28, further comprising transmitting only a single occurrence of said plurality of identical sequence to said KStore.

30. The method for updating said K node counts of said plurality of respective K node counts of claim 29, wherein said single occurrence of said sequence is represented by a further plurality of K nodes having a further plurality of respective node counts further comprising adding said multi sequence intensity value to node counts of said further plurality of respective K nodes.