Abstract: A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. The processes act on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. When restoring the full or partial save to a new memory, a translation table is used to convert the addresses of the nodes and their links to appropriately matched locations in the new memory so that the structure of the data store can be reconstructed in the new location and ensuring that there is sufficient protected memory for the structure as the restore is accomplished.

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.

Abstract: A method for updating a KStore including a K path having a subcomponent node and a root node wherein the subcomponent node has a pointer pointing to a root node and the root node has a pointer pointing to a subcomponent node includes determining a K path representing a sequence to be altered to provide a determined K path and altering at least one of (i) a subcomponent node of the determined K path, or (ii) a root node having a pointer pointing to a subcomponent node of the determined K path. Altering can include maintaining K structure for a history or completely removing a K path. Altering can include altering a subcomponent node of the determined K path. Memory allocated for storing the altered subcomponent node can be deallocated if the node is completely removed.

Abstract: A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. A previous process acted on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. This shows how to build a save file without saving all links, using a new restore process to restore the links instead.

Abstract: A method for transmitting information in a KStore system having a KStore, an application programming interface and an application layer wherein the information is transmitted between the KStore and the application layer includes transmitting the information between the KStore and the application layer by way of the application programming interface. The KStore is constrained by way of the application programming interface with at least one constraint to provide at least one selected K path. The KStore is focused to provide a further selected K path. At least one KStore parameter is determined in accordance with the selected K path to provide at least one determined K parameter. The constraining of the KStore includes traversing the at least one selected K path.

Abstract: A method of recording information in an interlocking trees datastore having a plurality of K paths includes receiving a data stream input sequence and traversing the interlocking trees datastore in accordance with the received input sequence for recording the received input sequence within the interlocking trees datastore. First determining whether a K path of the plurality of K paths matches the input sequence is performed and second determining that a new sequence has been encountered in accordance with the first determining is performed. New structure is built in accordance with the second determining. A path of the plurality of paths has a plurality of K nodes including a current K node, an adjacent K node that is adjacent to the current K node, the adjacent K node having a non-adjacent K node that is not in the asCase list of the current K node.

Abstract: A data analysis system for performing an analytic to obtain an analytic result in a computing device having memory including a data analyzer interface, at least one interlocking trees datastore within the associated memory, and at least one analytic application executed. The data analysis system of the invention also includes a plurality of interlocking trees datastores wherein the at least one interlocking trees datastore is selected from the plurality of interlocking trees datastores in accordance with the data analyzer interface. The system can include a plurality of data sources wherein the at least one interlocking trees datastore is created from a data source selected from the plurality of data sources in accordance with the data analyzer interface. The at least one interlocking trees datastore further can be a static interlocking trees datastore or a dynamic interlocking trees datastore. The at least one interlocking trees datastore continuously records new data.

Abstract: A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. A previous process acted on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. This shows how to build a save file without saving all links, using a new restore process to restore the links instead.

Abstract: A tree-based datastore comprising a forest of interconnected trees that can be generated and/or accessed may require specialized saving and restoring processes to ensure that all the links are properly maintained whether it will be restored in full or in part. The processes act on known features of the trees based datastore to generate a file of metadata and packetize each of the nodes of the structure, carefully saving the links and lists of links with old memory addresses accounted for. When restoring the full or partial save to a new memory, a translation table is used to convert the addresses of the nodes and their links to appropriately matched locations in the new memory so that the structure of the data store can be reconstructed in the new location and ensuring that there is sufficient protected memory for the structure as the restore is accomplished.