Method for reducing the scope of the K node construction lock
First Claim
1. A method executed at least in part on a computer for recording information in an interlocking trees datastore having a plurality of K paths, comprising:
- receiving an input particle to provide a received input particle;
recording said received input particle into said interlocking trees datastore by building a new K node to record said received input particle in said interlocking trees datastore, said interlocking trees datastore comprising root nodes and non-root nodes organized into a plurality of connected K paths, wherein the new K node of the interlocking trees datastore comprises a first pointer comprising a Case pointer pointing to a previous node, a second pointer comprising a Result pointer pointing to an elemental root node, a third pointer comprising an asCase List pointer pointing to a list of the subcomponent nodes or end product nodes for which the new K node is the Case node and a fourth pointer comprising an asResult List pointer pointing to a list of subcomponent nodes or end product nodes for which the new K node is the Result node, the plurality of connected K paths of the interlocking trees datastore comprising a first K path of a first tree of the interlocking trees datastore, the first K path comprising a primary root node linked to a subcomponent node with a first Case link, the subcomponent node linked to an end product node with a second Case link, and a second K path of a second tree of the interlocking trees datastore comprising an elemental root node linked to the subcomponent node with a Result link, such that a pointer to the elemental root node comprises the result entry of the subcomponent node and an asResult list of the elemental root node is updated to include the subcomponent node; and
locking a K node in accordance with said building of said new K node to provide a locked node.
13 Assignments
0 Petitions
Accused Products
Abstract
A method for recording information in an interlocking trees datastore having a plurality of K paths includes receiving an input particle and building a new K node in accordance with the received input particle. A K node is locked in accordance with the building of the new K node to provide a locked node. The locked node can be the Case node of the new K node. The Case bi-directional link between the locked Case node and the new K node is completed while the locked Case node is locked. A pointer is added to the new K node to an asCase list of the locked Case node. The locked node is locked only while adding the pointer to the new K node to the asCase list of the locked Case node. The locked node can also be a Result node of the new K node.
113 Citations
32 Claims
-
1. A method executed at least in part on a computer for recording information in an interlocking trees datastore having a plurality of K paths, comprising:
-
receiving an input particle to provide a received input particle; recording said received input particle into said interlocking trees datastore by building a new K node to record said received input particle in said interlocking trees datastore, said interlocking trees datastore comprising root nodes and non-root nodes organized into a plurality of connected K paths, wherein the new K node of the interlocking trees datastore comprises a first pointer comprising a Case pointer pointing to a previous node, a second pointer comprising a Result pointer pointing to an elemental root node, a third pointer comprising an asCase List pointer pointing to a list of the subcomponent nodes or end product nodes for which the new K node is the Case node and a fourth pointer comprising an asResult List pointer pointing to a list of subcomponent nodes or end product nodes for which the new K node is the Result node, the plurality of connected K paths of the interlocking trees datastore comprising a first K path of a first tree of the interlocking trees datastore, the first K path comprising a primary root node linked to a subcomponent node with a first Case link, the subcomponent node linked to an end product node with a second Case link, and a second K path of a second tree of the interlocking trees datastore comprising an elemental root node linked to the subcomponent node with a Result link, such that a pointer to the elemental root node comprises the result entry of the subcomponent node and an asResult list of the elemental root node is updated to include the subcomponent node; and locking a K node in accordance with said building of said new K node to provide a locked node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A computing system having a programmable processor and an attached medium capable of storing encoded data for recording information in an interlocking trees datastore having a plurality of K paths, the computing system comprising:
-
a received input particle stored within the computing system; a new K node built in accordance with said received input particle, said new K node recording said received input particle in said interlocking trees datastore; and a locked node wherein said locked node is locked in accordance with said building of said new K node; wherein the interlocking trees datastore comprising root nodes and non-root nodes using digitally encoded data stored within the attached storage medium being organized into a plurality of trees comprising connected K paths; the new K node of the interlocking trees datastore comprises; a first pointer comprising a Case pointer pointing to a previous node; a second pointer comprising a Result pointer pointing to an elemental root node; a third pointer comprising an asCase List pointer pointing to a list of the subcomponent nodes or end product nodes for which the new K node is the Case node; and a forth pointer comprising an asResultList pointer pointing to a list of subcomponent nodes or end product nodes for which the new K node is the Result node; and the plurality of connected K paths of the interlocking trees datastore having a plurality of K paths comprises; a first K path of a first tree of the interlocking trees datastore, the first K path comprising a primary root node linked to a subcomponent node with a first Case link, the subcomponent node linked to an end product node with a second Case link; and a second K path of a second tree of the interlocking trees datastore comprising an elemental root node linked to the subcomponent node with a Result link, such that a pointer to the elemental root node comprises the result entry of the subcomponent node and an asResult list of the elemental root node is updated to include the subcomponent node. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
Specification