Utilities for Deriving Values and Information From Within an Interlocking Trees Data Store

Abstract

A method for accessing a KStore including at least one K path having at least one subcomponent node and at least one root node includes providing a utility routine and accessing the KStore using the utility routine. The accessing may include traversing the at least one K path. The at least one K path includes a further node and bidirectional links between the at least one subcomponent node and the further node. The method includes traversing between the at least one subcomponent node and the further node by way of the bidirectional links. The further node can be a beginning of thought node, an end of thought node, root node, or a subcomponent node. A location may be determined within the KStore. The K Store may be queried. Searches for information within the KStore may be performed. The KStore may be traversed to constrain and focus the KStore. The KStore may be updated.

1 - 25 . (canceled) 
     
     
         26 . A computer-readable data product containing encoded data that when read represents programmable instruction that when executed within a computing system implements a method for accessing a KStore including at least one K path having at least one subcomponent node and at least one root node, the method comprising:
 (a) providing a utility routine; and   (b) accessing said KStore using said utility routine, said KStore comprising an interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end product nodes using asCase and asResult bidirectional links between the elemental root nodes, subcomponent nodes and end product nodes for determining paths within the interlocking trees datastore structure, said interlocking trees datastore comprising a first tree depending from a first root node and including at least one of a plurality of branches, wherein each of the plurality of branches ends in an end product node comprising a leaf node, said interlocking trees datastore further comprising a second root of a second tree linked to each end product node, said interlocking trees datastore further comprising at least a third tree, wherein a root of the third tree comprises an elemental node representing a particle, the root of the third tree linked to at least one node in at least one branch of the first tree; and   wherein a first Case node, said first Case node referencing a node in a Case path;   a first Result node, said first Result node referencing a node in a Result path; and a first subcomponent node wherein said first subcomponent node (i) represents a logical relationship between said first Case node and said first Result node in accordance with said data and (ii) is adapted to serve as a second Case node;   asCase link represents a link to the first of the two nodes from which a node is created; and   asResult link represents a link to the second of the two nodes from which a node is created.   
     
     
         27 . The computer-readable data product for accessing a KStore of  claim 26 , wherein said accessing further comprises traversing said at least one K path. 
     
     
         28 . The computer-readable data product for accessing a KStore of  claim 27 , wherein said at least one K path includes a further node and bidirectional links between said at least one subcomponent node and said further node further comprising traversing between said at least one subcomponent node and said further node by way of said bidirectional links. 
     
     
         29 . The computer-readable data product for accessing a KStore of  claim 28 , wherein said further node comprises a beginning of thought node, said beginning of thought node comprising a last node of the at least one K path traversed in a direction beginning with an end product node or a first node of the at least one K path traversed in a direction beginning with the beginning of thought node. 
     
     
         30 . The computer-readable data product for accessing a KStore of  claim 28 , wherein said further node comprises an end of thought node, said end of thought node representing a complete particle sequence. 
     
     
         31 . The computer-readable data product for accessing a KStore of  claim 28 , wherein said further node comprises a subcomponent node, said subcomponent node referencing a particle of a particle sequence. 
     
     
         32 . The computer-readable data product for accessing a KStore of  claim 26 , wherein said further node comprises a root node, said root node referencing a particle value. 
     
     
         33 . The computer-readable data product for accessing a KStore of  claim 26 , further comprising determining a location within said KStore. 
     
     
         34 . The computer-readable data product for accessing a KStore of  claim 26 , further comprising querying said KStore. 
     
     
         35 . The computer-readable data product for accessing a KStore of  claim 34 , further comprising searching for information within said KStore. 
     
     
         36 . The method for accessing a KStore of  claim 34 , further comprising determining information about said KStore. 
     
     
         37 . The computer-readable data product for accessing a KStore of  claim 35 , further comprising searching in accordance with a mask. 
     
     
         38 . The computer-readable data product for accessing a KStore of  claim 34 , further comprising traversing said KStore to constrain said KStore. 
     
     
         39 . The computer-readable data product for accessing a KStore of  claim 26 , wherein said utility routine retrieves a particle value from the at least one root node of the at least one K path, the at least one root node comprising an elemental root node. 
     
     
         40 . The computer-readable data product for accessing a KStore of  claim 26 , wherein said utility routine returns a value for the at least one K path or for sets of nodes on a level of the KStore by traversing a structure of the KStore and returning particle sequences associated with the traversed structure. 
     
     
         41 . The computer-readable data product for accessing a KStore of  claim 26 , further comprising updating said KStore. 
     
     
         42 . A computer-readable data product containing encoded data that when read represents programmable instruction that when executed within a computing system implements a method for transmitting information in a KStore wherein said KStore is operably coupled to an application layer further comprising preventing internal KStore information from being transmitted from said KStore to said application layer, said KStore including at least one K path having at least one subcomponent node and at least one root node, said method comprising:
 (a) providing a utility routine; and   (b) accessing said KStore using said utility routine, said KStore comprising an interlocking trees datastore structure comprising elemental root nodes, subcomponent nodes and end product nodes using asCase and asResult bidirectional links between the elemental root nodes, subcomponent nodes and end product nodes for determining paths within the interlocking trees datastore structure, said interlocking trees datastore comprising a first tree depending from a first root node and including at least one of a plurality of branches, wherein each of the plurality of branches ends in an end product node comprising a leaf node, said interlocking trees datastore further comprising a second root of a second tree linked to each end product node, said interlocking trees datastore further comprising at least a third tree, wherein a root of the third tree comprises an elemental node representing a particle, the root of the third tree linked to at least one node in at least one branch of the first tree; and   wherein a first Case node, said first Case node referencing a node in a Case path;   a first Result node, said first Result node referencing a node in a Result path; and   
       a first subcomponent node wherein said first subcomponent node (i) represents a logical relationship between said first Case node and said first Result node in accordance with said data and (ii) is adapted to serve as a second Case node;
 an asCase link represents a link to the first of the two nodes from which a node is created; and 
 an asResult link represents a link to the second of the two nodes from which a node is created.