Method for processing counts when an end node is encountered
First Claim
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.
8 Assignments
0 Petitions
Accused Products
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.
-
Citations
43 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43)
-
Specification