| 摘要 |
A tree-based data store comprising a forest of interconnected trees is generated and/or accessed. The tree-based data store comprises a first tree that depends from a first root node and may include a plurality of branched. Each of the branches of the first tree ends in a leaf node. Each leaf node (Fig. 3a, 302, and 312) may represent an end product, as described more full y below. A second root (Fig. 3a, 314) of the same tree-based data store is linked to each leaf node representing an end product (Fig. 3a, 328). Hence, the second root is essentially a root to an inverted order of the first tree , but the first tree is not duplicated. Finally, the tree-based data store comprises a plurality of trees in which the root node of each of these trees is an elemental node (Fig. 3c), as described more fully below. The root node of each of these trees may be linked to one or more nodes in on or more branches of the first tree. The nodes of the tree-based data store contain only pointers to other nodes in the tree-based data store. The roots of the trees in the forest of trees comprising the tree-based data store may be linked to data.
|
