×

Utilities for deriving values and information from within an interlocking trees data store

  • US 7,676,477 B1
  • Filed: 10/24/2005
  • Issued: 03/09/2010
  • Est. Priority Date: 10/24/2005
  • Status: Active Grant
First Claim
Patent Images

1. A method for accessing a KStore including at least one K path having at least one subcomponent node and at least one root node, 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.

View all claims
  • 11 Assignments
Timeline View
Assignment View
    ×
    ×