Graph database devices and methods for partitioning graphs
AssigneeNeo Technology, Inc.
InventorsJames WEBBER, Ian S. ROBINSON, Mats Tobias LINDAAKER, Alistair Philip CAMPBELL JONES
Life of this patent
Estimating the term…
Abstract
A method and apparatus for partitioning a graph database that includes nodes connected to one another is presented. The method entails determining a node type indicating a type of node that is to be used as mapped nodes, and upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node. The apparatus includes modules containing computer-executable instructions to perform the above method.
Claims20
A computer-implemented method of partitioning a graph database, wherein the graph database includes nodes connected to one another, comprising:
- determining a node type indicating a type of node that is to be used as mapped nodes;
- and
- upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node.
A non-transitory computer-readable medium storing instructions that, when executed, cause a computer to perform a method of partitioning a graph database that includes nodes connected to one another, the instructions comprising:
- an instruction to determine a node type indicating a type of node that is to be used as mapped nodes;
- an instruction to, upon receiving a new node, place the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and place the new node in a partition according to its connections to other nodes if it is not a mapped node.
An apparatus for partitioning a graph database that includes nodes connected to one another wherein each of the nodes is associated with at least one property value, the apparatus comprising:
- a pattern storage module storing a first set of domain-specific instructions for determining a node type to be used as mapped nodes and a second set of instructions for identifying a node as a connected node;
- a graph partitioning module storing instructions for placing a new node into one of a plurality of partitions;
- and
- a partitioned graph storage module configured to store information about nodes including their property values, and interconnections between nodes in a partition.
Dependencies are inferred from the claim text.