@recallgraph
A version-controlled graph database
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.
Consultation calls to help you dive deeper into concepts, use cases, and how RecallGraph can address your temporal data management needs.
May 6, 2021 · 1 min read · A temporal database is one that gives you access to historical data, i.e., old data which would've otherwise been overwritten by new data, e.g. during an entity update. However, this is an incomplete picture, since temporality is often modelled at th...
Join discussionApr 26, 2021 · 3 min read · At the time of writing this post, all of RecallGraph's API endpoints are designed to serve a particular type of temporal query, viz. point-in-time queries. However, there are actually several classes of temporal queries that a temporal database could...
Join discussionApr 26, 2021 · 2 min read · Quick reference For single document writes (create/update/replace/delete) - YES. For bulk document writes (create/update/replace/delete) - NO. For restoring a node-brace path pattern resolving to a single document - YES. For all other restores - NO....
Join discussionApr 24, 2021 · 2 min read · Another question I often get: "How does RecallGraph stack up against AWS Timestream (or some other time-series database)"? Short Answer RecallGraph is NOT a time-series database, and hence should not be compared to one. Rather, it is a temporal dat...
Join discussionApr 24, 2021 · 1 min read · If the query language in question supports arbitrary traversal depths and temporal clauses, then it could, hypothetically, be used to query RecallGraph's data. However, the latter requirement rules out most popular graph query languages, including Gr...
Join discussion