Time-based graph data model
First Claim
Patent Images
1. A computer-implemented method for accessing data from a database, the method comprising:
- receiving a request, the request comprising time-based information and relationship information;
comparing the time-based information of the request with a first time interval, the first time interval associated with at least one node of a graph, wherein the at least one node is associated with an entity, and the at least one node includes an attribute of the entity;
matching the at least one node of the graph, the matching of the at least one node based on the time-based information being at least partially within the first time interval;
returning a result, the result comprising a first indicator of the at least one node;
comparing the relationship information of the request with a relationship status, the relationship status associated with at least one edge of the graph; and
matching the at least one edge of the graph, the matching of the at least one edge based on the relationship information matching the relationship status, wherein the result further comprises a second indicator of the at least one edge, and the at least one edge connects the at least one node to a second node.
1 Assignment
0 Petitions
Accused Products
Abstract
Systems and processes for accessing data from a graph database are described. The system receives a request comprising time-based information. Time-based information of the request is compared with a first time interval, which is associated with at least one node of a graph. The node of the graph is matched based on the time-based information being at least partially within the first time interval. The system returns a result comprising an indicator of the node of the graph, wherein the node of the graph is associated with an entity, and the node of the graph includes an attribute of the entity.
9 Citations
31 Claims
-
1. A computer-implemented method for accessing data from a database, the method comprising:
-
receiving a request, the request comprising time-based information and relationship information; comparing the time-based information of the request with a first time interval, the first time interval associated with at least one node of a graph, wherein the at least one node is associated with an entity, and the at least one node includes an attribute of the entity; matching the at least one node of the graph, the matching of the at least one node based on the time-based information being at least partially within the first time interval; returning a result, the result comprising a first indicator of the at least one node; comparing the relationship information of the request with a relationship status, the relationship status associated with at least one edge of the graph; and matching the at least one edge of the graph, the matching of the at least one edge based on the relationship information matching the relationship status, wherein the result further comprises a second indicator of the at least one edge, and the at least one edge connects the at least one node to a second node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A non-transitory computer-readable storage medium comprising computer-executable instructions which when executed by a processor, cause the processor to:
-
receive a request, the request comprising time-based information and relationship information; compare the time-based information of the request with a first time interval, the first time interval associated with at least one node of a graph, wherein the at least one node is associated with an entity, and the at least one node includes an attribute of the entity; match the at least one node of the graph, the matching of the at least one node based on the time-based information being at least partially within the first time interval; return a result, the result comprising a first indicator of the at least one node; compare the relationship information of the request with a relationship status, the relationship status associated with at least one edge of the graph; and match the at least one edge of the graph based on the relationship information matching the relationship status, wherein the result further comprises a second indicator of the at least one edge, and the at least one edge connects the at least one node to a second node. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. An apparatus for accessing data from a database, the apparatus comprising:
-
a memory configured to store data; and a computer processor configured to; receive a request, the request comprising time-based information and relationship information; compare the time-based information of the request with a first time interval, the first time interval associated with at least one node of a graph, wherein the at least one node is associated with an entity, and the at least one node includes an attribute of the entity; match the at least one node of the graph based on the time-based information being at least partially within the first time interval; return a result, the result comprising a first indicator of the at least one node; access a relationship information; compare the relationship information of the request with a relationship status, the relationship status associated with at least one edge of the graph; and match the at least one edge of the graph, the matching of the at least one edge based on the relationship information matching the relationship status, wherein the result further comprises a second indicator of the at least one edge, and the at least one edge connects the at least one node to a second node. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30)
-
-
31. A non-transitory computer-readable storage medium comprising computer-executable instructions for accessing data from a database, the instructions when executed by a processor causing the processor to:
-
receive a request, the request comprising a node constraint value and an edge constraint value; traverse at least a portion of a graph of the graph database, the traversal being in response to receiving the request; determine a first match of a first node of the graph, the first match based on the node constraint; determine a second match of a second node of the graph, the second match based on the edge constraint; return a result, the result comprising a first indicator of the first node and a second indicator of the second node; wherein the first node is associated with a first entity, the first node includes an attribute of the first entity, and the first node comprises a first version information of the first entity and a second version information of the first entity; and wherein the second node is associated with a second entity, the second node includes an attribute of the second entity, and the second node comprises a third version information of the second entity and a fourth version information of second the entity.
-
Specification