Multiple database updates using paths

Abstract

Systems and methods for multiple updates to a database using paths is disclosed. Updates to a graph database can be performed by associating an attribute node, that stores the updated value, to the entity node to-be updated. When the entity node is queried for the value, the nearest attribute node is identified using a shortest path determination.

What is claimed is: 
     
         1 . A method of querying a graph database, the method comprising:
 receiving a graph database query for a value of an attribute for a child entity node in the graph database, the graph database including a plurality of entity nodes and a plurality of attribute nodes, the plurality of entity nodes organized into a hierarchy of entity nodes;   determining that a path between the child entity node and a first attribute node of the plurality of attribute nodes satisfies a path metric; and   returning an attribute value of the first attribute node as a response to the graph database query.   
     
     
         2 . The method of  claim 1 , further comprising:
 determining that the first attribute node is a nearest attribute node to the child entity node of the plurality of attribute nodes in the graph database, wherein the attribute value of the first attribute node is returned based at least in part on the first attribute node being the nearest attribute node to the child entity node.   
     
     
         3 . The method of  claim 1 , wherein determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric comprises:
 determining that the path is a shortest path of a plurality of paths between the child entity node and each attribute node of the plurality of attribute nodes.   
     
     
         4 . The method of  claim 1 , wherein receiving the graph database query comprises:
 receiving the graph database query that comprises a read request for the value of the attribute.   
     
     
         5 . The method of  claim 1 , wherein determining the path comprises:
 determining the path between the child entity node and the first attribute node that includes a parent entity node for the child entity node in the graph database.   
     
     
         6 . The method of  claim 1 , wherein determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric comprises:
 determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric that is a path length between the child entity node and the first attribute node.   
     
     
         7 . The method of  claim 1 , further comprising:
 receiving a second graph database query for a second value of the attribute for a second child entity node in the graph database;   determining that a second path between the second child entity node and a second attribute node of the plurality of attribute nodes satisfies the path metric; and   returning a second attribute value of the second attribute node as a second response to the second graph database query.   
     
     
         8 . The method of  claim 7 , wherein the second attribute node is different than or the same as the first attribute node. 
     
     
         9 . A system for querying a graph database, the system comprising:
 one or more hardware processors; and   a memory storing instructions that, when executed by the one or more hardware processors, cause the system to perform operations comprising:   receiving a graph database query for a value of an attribute for a child entity node in the graph database, the graph database including a plurality of entity nodes and a plurality of attribute nodes, the plurality of entity nodes organized into a hierarchy of entity nodes;   determining that a path between the child entity node and a first attribute node of the plurality of attribute nodes satisfies a path metric; and   returning an attribute value of the first attribute node as a response to the graph database query.   
     
     
         10 . The system of  claim 9 , wherein the instructions are further executable by the one or more hardware processors to cause the system to perform operations comprising:
 determining that the first attribute node is a nearest attribute node to the child entity node of the plurality of attribute nodes in the graph database, wherein the attribute value of the first attribute node is returned based at least in part on the first attribute node being the nearest attribute node to the child entity node.   
     
     
         11 . The system of  claim 9 , wherein the instructions for determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric are further executable by the one or more hardware processors to cause the system to perform operations comprising:
 determining that the path is a shortest path of a plurality of paths between the child entity node and each attribute node of the plurality of attribute nodes.   
     
     
         12 . The system of  claim 9 , wherein the instructions for receiving the graph database query are further executable by the one or more hardware processors to cause the system to perform operations comprising:
 receiving the graph database query that comprises a read request for the value of the attribute.   
     
     
         13 . The system of  claim 9 , wherein the instructions for determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric are further executable by the one or more hardware processors to cause the system to perform operations comprising:
 determining the path between the child entity node and the first attribute node that includes a parent entity node for the child entity node in the graph database.   
     
     
         14 . The system of  claim 9 , wherein the instructions for determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric are further executable by the one or more hardware processors to cause the system to perform operations comprising:
 determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric that is a path length between the child entity node and the first attribute node.   
     
     
         15 . A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more hardware processors, cause a machine to perform operations for querying a graph database, the operations comprising:
 receiving a graph database query for a value of an attribute for a child entity node in the graph database, the graph database including a plurality of entity nodes and a plurality of attribute nodes, the plurality of entity nodes organized into a hierarchy of entity nodes;   determining that a path between the child entity node and a first attribute node of the plurality of attribute nodes satisfies a path metric; and   returning an attribute value of the first attribute node as a response to the graph database query.   
     
     
         16 . The non-transitory machine-readable storage medium of  claim 15 , wherein the instructions, when executed, further cause the machine to perform operations comprising:
 determining that the first attribute node is a nearest attribute node to the child entity node of the plurality of attribute nodes in the graph database, wherein the attribute value of the first attribute node is returned based at least in part on the first attribute node being the nearest attribute node to the child entity node.   
     
     
         17 . The non-transitory machine-readable storage medium of  claim 15 , wherein the instructions for determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric are further executable to cause the machine to perform operations comprising:
 determining that the path is a shortest path of a plurality of paths between the child entity node and each attribute node of the plurality of attribute nodes.   
     
     
         18 . The non-transitory machine-readable storage medium of  claim 15 , wherein the instructions for receiving the graph database query are further executable to cause the machine to perform operations comprising:
 receiving the graph database query that comprises a read request for the value of the attribute.   
     
     
         19 . The non-transitory machine-readable storage medium of  claim 15 , wherein the instructions for determining the path are further executable to cause the machine to perform operations comprising:
 determining the path between the child entity node and the first attribute node that includes a parent entity node for the child entity node in the graph database.   
     
     
         20 . The non-transitory machine-readable storage medium of  claim 15 , wherein the instructions for determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric are further executable to cause the machine to perform operations comprising:
 determining that the path between the child entity node and the first attribute node of the plurality of attribute nodes satisfies the path metric that is a path length between the child entity node and the first attribute node.