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.

 
Web www.patentalert.com

< Auction for financially settled contracts

> Serialization of file system item(s) and associated entity(ies)

> Method and system for storage and fast retrieval of digital terrain model elevations for use in positioning systems

~ 00586