Patent Document ID: 7716241
Application ID: 10975332
Patent Flag: 1

Claim One:
1. A method of storing data from a plurality of data sources into an interlocking trees datastore within memory of a computing system comprising a KStore, whereby said sources of data remain distinguishable for each data stream from said plurality of data sources when stored into said interlocking trees datastore, said method comprising: receiving a sequence from a stream of data from a first one of said plurality of data sources, identifying by associating with said sequence, an identity indicator that indicates from which one of said plurality of sources said sequence originated, creating a particle stream based on said sequence and said identity indicator and sending said particle stream to said interlocking trees data store within the memory of the computing system via a K Engine, said interlocking trees data store comprising nodes and non-root nodes organized into a plurality of connected trees, the plurality of connected trees comprising an asCase tree and at least one of a plurality of asResult trees, the asCase tree comprising a first root and at least one of a plurality of non-root nodes, the at least one non-root node comprising a first Case node, and the at least one asResult tree comprising a second root node representing a particle of the particle stream and at least one of a plurality of non-root nodes common with the nodes of the asCase tree, the at least one non-root node common with the nodes of the asCase tree comprising a first Result node, the interlocking trees data store comprising asCase and asResult paths, wherein an asCase path comprises a sequence of sub-component nodes linked with bi-directional asCase links ending with an end-product node and where each sub-component node in the asCase path has a bi-directional asResult link to an elemental root node or end-product node, comprising an asResult path.