EFFICIENT TEMPORAL GRAPH DATA MANAGEMENT
A temporal graph database system is disclosed. In various embodiments, a call to a graph temporal application programming interface (API) is received via a communication interface. An estimated cardinality associated with the API call is determined. A selected graph temporal store to be used to generate a response to the API call is selected based at least in part on the estimated cardinality, wherein the selected graph temporal store is included in a plurality of graph temporal stores associated with a graph with which the API call is associated. The selected graph temporal store is used to generate a response to the API call.
1 . A temporal graph database system, comprising:
communication interface configured to receive a call to a graph temporal application programming interface (API); and
a processor coupled to the communication interface and configured to:
determine based at least in part on an API call received via the communication interface an estimated cardinality associated with the API call;
select, based at least in part on the estimated cardinality, a selected graph temporal store to be used to generate a response to the API call, wherein the selected graph temporal store is included in a plurality of graph temporal stores associated with a graph with which the API call is associated;
use the selected graph temporal store to generate a response to the API call; and
provide the response via the communication interface.
2 . The system of claim 1 , wherein the plurality of graph temporal stores includes a snapshot-based graph temporal store.
3 . The system of claim 2 , wherein the snapshot-based graph temporal store comprises a plurality of snapshots of a graph, each snapshot is associated with a corresponding timestamp, and the snapshot-based graph temporal store indexed by timestamp.
4 . The system of claim 2 , wherein the snapshot-based graph temporal store further includes a time-ordered log of updates between snapshots.
5 . The system of claim 2 , wherein the snapshot-based graph temporal store is selected based at least in part on a determination that the estimated cardinality is greater than a prescribed threshold.
6 . The system of claim 5 , wherein the prescribed threshold is associated with thirty percent of the graph.
7 . The system of claim 2 , wherein the plurality of graph temporal stores further includes an entity-based temporal graph store.
8 . The system of claim 7 , wherein the entity-based temporal graph store includes for each of a plurality of graph entities one or both of a start time when the entity was created or last modified and an end time when the entity was deleted.
9 . The system of claim 7 , wherein the entity-based temporal graph store is indexed by entity identifier (ID).
10 . The system of claim 7 , wherein the processor is configured to select and use the entity-based temporal graph store to respond to an API call comprising a point query.
11 . The system of claim 7 , wherein the processor is configured to select and use the entity-based temporal graph store to respond to an API call comprising a subgraph query associatedwith an entity and its n hop neighbors.
12 . The system of claim 1 , wherein the response includes graph and associated temporal information which are used to apply a temporal algorithm to the graph.
13 . The system of claim 12 , wherein the graph and associated temporal information included in the response are used to apply a temporal algorithm to the graph by performing incremental graph computations.
14 . The system of claim 13 , wherein the incremental graph computations are facilitated at least in part by a compute-efficient in-memory representation of the temporal graph data.
15 . The system of claim 1 , wherein the processor is further configured to receive a graph database transaction associated with the graph and update said plurality of graph temporal stores associated with the graph.
16 . The system of claim 15 , wherein the update includes adding a record to a time-ordered updates log.
17 . The system of claim 15 , wherein the update includes adding or updating a time associated with an entity with which the transaction is associated.
18 . The system of claim 17 , wherein the time comprises one or both of a system time and an application time.
19 . A method, comprising:
receiving via a communication interface a call to a graph temporal application programming interface (API);
determining based at least in part on an API call an estimated cardinality associated with the API call;
selecting, based at least in part on the estimated cardinality, a selected graph temporal store to be used to generate a response to the API call, wherein the selected graph temporal store is included in a plurality of graph temporal stores associated with a graph with which the API call is associated;
using the selected graph temporal store to generate a response to the API call; and
providing the response via the communication interface.
20 . A computer program product embodied in a non-transitory computer readable medium and comprising computer instructions for:
receiving via a communication interface a call to a graph temporal application programming interface (API);
determining based at least in part on an API call an estimated cardinality associated with the API call;
selecting, based at least in part on the estimated cardinality, a selected graph temporal store to be used to generate a response to the API call, wherein the selected graph temporal store is included in a plurality of graph temporal stores associated with a graph with which the API call is associated;
using the selected graph temporal store to generate a response to the API call; and
providing the response via the communication interface.