Recallgraph Lifetime Deal $29.00
A time-dependent graph is, informally speaking, a graph structure dynamically changes with time. In such graphs, the weights associated with edges dynamically change over time, that is, the edges in such graphs are activated by sequences of time-dependent elements. Many real-life scenarios can be better modeled by time-dependent graphs, such as bioinformatics networks, transportation networks, and social networks.
In particular, the time-dependent graph is a very broad concept, which is reflected in the related research with many names, including temporal graphs, evolving graphs, time-varying graphs, historical graphs, and so on. Though static graphs have been extensively studied, for their time-dependent generalizations, we are still far from a complete and mature theory of models and algorithms.
RecallGraph is a versioned-graph data store – it retains all changes that its data (vertices and edges) have gone through to reach their current state.
It supports point-in-time graph traversals, letting the user query any past state of the graph just as easily as the present.
RecallGraph is a potential fit for scenarios where data is best represented as a network of vertices and edges (i.e., a graph) having the following characteristics:
- Both vertices and edges can hold properties in the form of attribute/value pairs (equivalent to JSON objects).
- Documents (vertices/edges) mutate within their lifespan (both in their individual attributes/values and in their relations with each other).
- Past states of documents are as important as their present, necessitating retention and queryability of their change history