Abstract: A temporal graph model is provided that can handle all six graph updates cases: vertex created; vertex deleted; vertex property updated; edge created; edge deleted; and edge property updated. A memory efficient temporal graph storage solution stores the delta change of graph evolution at each update (e.g., instead of storing the whole graph snapshot at each time). Temporal graph querying techniques are described that can determine what the graph looks like at a given time in the past and can perform any graph query on that graph's snapshot at that time as if time traveling back to that time. Also provided are event sourcing techniques of recording and tracing temporal graph updates that make the evolution of the temporal graph explainable. Further provided is a seamless integration with a massive parallel graph processing and storage engine that fully leverages the multicore and multinode cluster computation and storage resources.

Abstract: A system for querying a graph model and methods for making and using same. An initial vertex set can be received for one or more query blocks. The one or more query blocks can be executed to generate respective output vertex sets. The output vertex sets and the initial vertex set can be enabled to interconnect in a vertex-set-flow graph based on the query blocks. The vertex-set-flow graph can have a Directed Acyclic Graph shape. A selected query block can generate an output vertex set based on an input vertex set with or without traversal over an edge. A selected query block can calculate a runtime attribute. Edges and/or vertices of the graph model can be updated during querying. A selected block can call a graph query as a generic function. Functions for querying the graph model are powerful and can advantageously meet various graph query needs.

Abstract: A system for querying a graph model and methods for making and using same. An initial vertex set can be received for one or more query blocks. The one or more query blocks can be executed to generate respective output vertex sets. The output vertex sets and the initial vertex set can be enabled to interconnect in a vertex-set-flow graph based on the query blocks. The vertex-set-flow graph can have a Directed Acyclic Graph shape. A selected query block can generate an output vertex set based on an input vertex set with or without traversal over an edge. A selected query block can calculate a runtime attribute. Edges and/or vertices of the graph model can be updated during querying. A selected block can call a graph query as a generic function. Functions for querying the graph model are powerful and can advantageously meet various graph query needs.