Data referencing within a database graph
AssigneeMicrosoft Corporation
InventorsRobert William Lord, Christopher Allen Suver
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Corporation
InventorsRobert William Lord, Christopher Allen Suver
Estimating the term…
The present invention is directed to providing a higher degree of association between nodes and links in a graph by creating data structures (spiders) that provide views into graphs that transcend the relatively static association of a conventional graph. A spider's variables bind to any number of nodes and links in the graph, enabling all of the bound nodes and links by addressing the spider. By adding constraints on the extent or degree of binding in a spider to a graph, a subset of the graph is identified. The spider can then used to address the subset of the graph as constrained by the spider. A spider can bind to a link in order to identify a parent/child structural subset of the graph. More specifically a spider is a collection of variables that create a template or pattern and bind to the nodes and links in the graph. A spider traverses a graph by binding its variables to various nodes and links in the graph.
A computerized method for managing a graph comprising:
A computerized method for managing a graph comprising:
A computerized method for managing a graph comprising:
A computerized method for managing a graph comprising:
A computerized system comprising:
Dependencies are inferred from the claim text.