Patent ID: 8516004
Filing Date: 2013-08-20
Classification: G06F

Abstract:
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.