Accessing data in an interlocking trees data structure using an application programming interface
First Claim
1. A method for transmitting information in a KStore system having a KStore, the method comprising:
- transmitting information between said KStore and an application layer by way of an application programming interface;
processing said information within said KStore; and
returning result information between said KStore and said application by way of said application programming interface;
wherein the KStore comprising;
an interlocking trees datastore situated within memory accessible to an application programming interface running in a computer comprising root nodes and non-root nodes organized into a plurality of connected trees, each node in the interlocking trees datastore comprising a Case pointer pointing to a first portion of a non-root node, a Result pointer pointing to a second portion of the non-root node, a pointer to an asCase list;
an asCase tree comprising a first root and at least one of a plurality of non-root nodes,at least one asResult tree comprising a second root node and at least one of a plurality of non-root nodes common with the nodes of the asCase tree;
at least one K path;
an application layer;
the application programming interface coupled to said KStore and said application layer wherein information is transmitted between said KStore and said application layer by way of said application programming interface;
the asCase list comprising a linked list of nodes for which the node is a first portion and a pointer to an asResult list;
the asResult list comprising a linked list of non-root nodes for which the node is a second portion;
the at least one non-root node comprising a first Case node and at least one of a plurality of asResult trees;
the at least one non-root node common with the nodes of the asCase tree comprising a first Result node, the nodes of the interlocking trees datastore including at least one elemental node representing a dataset element, at least one non-root node; and
the at least one non-root node comprising a first subcomponent node and at least one end product node; and
the at least one K path comprising a portion of a tree of the interlocking trees datastore, said portion determined by at least one of said Case pointer, said Result pointer, said asCase list pointer and said asResult list pointer.
9 Assignments
0 Petitions
Accused Products
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.
-
Citations
38 Claims
-
1. A method for transmitting information in a KStore system having a KStore, the method comprising:
-
transmitting information between said KStore and an application layer by way of an application programming interface; processing said information within said KStore; and returning result information between said KStore and said application by way of said application programming interface; wherein the KStore comprising; an interlocking trees datastore situated within memory accessible to an application programming interface running in a computer comprising root nodes and non-root nodes organized into a plurality of connected trees, each node in the interlocking trees datastore comprising a Case pointer pointing to a first portion of a non-root node, a Result pointer pointing to a second portion of the non-root node, a pointer to an asCase list; an asCase tree comprising a first root and at least one of a plurality of non-root nodes, at least one asResult tree comprising a second root node and at least one of a plurality of non-root nodes common with the nodes of the asCase tree; at least one K path; an application layer; the application programming interface coupled to said KStore and said application layer wherein information is transmitted between said KStore and said application layer by way of said application programming interface; the asCase list comprising a linked list of nodes for which the node is a first portion and a pointer to an asResult list; the asResult list comprising a linked list of non-root nodes for which the node is a second portion; the at least one non-root node comprising a first Case node and at least one of a plurality of asResult trees; the at least one non-root node common with the nodes of the asCase tree comprising a first Result node, the nodes of the interlocking trees datastore including at least one elemental node representing a dataset element, at least one non-root node; and the at least one non-root node comprising a first subcomponent node and at least one end product node; and the at least one K path comprising a portion of a tree of the interlocking trees datastore, said portion determined by at least one of said Case pointer, said Result pointer, said asCase list pointer and said asResult list pointer. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33)
-
-
34. A KStore system having a KStore with at least one K path, the KStore system comprising:
-
an interlocking trees datastore situated within memory accessible to an application programming interface running in a computer comprising root nodes and non-root nodes organized into a plurality of connected trees, each node in the interlocking trees datastore comprising a Case pointer pointing to a first portion of a non-root node, a Result pointer pointing to a second portion of the non-root node, a pointer to an asCase list; an asCase tree comprising a first root and at least one of a plurality of non-root nodes, at least one asResult tree comprising a second root node and at least one of a plurality of non-root nodes common with the nodes of the asCase tree; at least one K path; an application layer; and the application programming interface coupled to said KStore and said application layer wherein information is transmitted between said KStore and said application layer by way of said application programming interface; wherein; the asCase list comprising a linked list of nodes for which the node is a first portion and a pointer to an asResult list; the asResult list comprising a linked list of non-root nodes for which the node is a second portion; the at least one non-root node comprising a first Case node and at least one of a plurality of asResult trees; the at least one non-root node common with the nodes of the asCase tree comprising a first Result node, the nodes of the interlocking trees datastore including at least one elemental node representing a dataset element, at least one non-root node; and the at least one non-root node comprising a first subcomponent node and at least one end product node; and the at least one K path comprising a portion of a tree of the interlocking trees datastore, said portion determined by at least one of said Case pointer, said Result pointer, said asCase list pointer and said asResult list pointer. - View Dependent Claims (35, 36, 37, 38)
-
Specification