Time-based graph data model
AssigneeMagnet Systems, Inc.
InventorsMagdi MORSI, Chih-Po WEN, Robyn J. CHAN, Hanju KIM
Life of this patent
Estimating the term…
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.
Claims34
A computer-implemented method for accessing data from a graph database, the method comprising:
- receiving a request, the request comprising time-based 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;
- 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;
- and
- wherein the at least one node is associated with an entity, and the at least one node includes an attribute of the entity.
A non-transitory computer-readable storage medium comprising computer-executable instructions for accessing data from a graph database, the instructions comprising:
- receiving a request, the request comprising time-based 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;
- 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;
- and
- wherein the at least one node is associated with an entity, and the at least one node includes an attribute of the entity.
An apparatus for accessing data from a graph 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;
- 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;
- 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;
- and
- wherein the at least one node is associated with an entity, and the at least one node includes an attribute of the entity.
A non-transitory computer-readable storage medium comprising computer-executable instructions for accessing data from a graph database, the instructions comprising:
- receiving a request, the request comprising a node constraint value and an edge constraint value;
- traversing at least a portion of a graph of the graph database, the traversal being in response to receiving the request;
- determining a first match of a first node of the graph, the first match based on the node constraint;
- determining a second match of a second node of the graph, the second match based on the edge constraint;
- returning 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.
Dependencies are inferred from the claim text.