By
Aditya
AdityaRecallGraph
What is RecallGraph?
It 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 tool in the Graph Databases category of a tech stack.
Key Features
Create single/multiple documents (vertices/edges)Replace entire single/multiple documents with new contentDelete single/multiple documentsAdd/Update specific fields in single/multiple documentsRestore deleted nodes back to their last known undeleted statePoint-in-time checkoutsAsync implicit commits
RecallGraph Pros & Cons
Pros of RecallGraph
No pros listed yet.
Cons of RecallGraph
No cons listed yet.
RecallGraph Alternatives & Comparisons
What are some alternatives to RecallGraph?
Neo4j
Neo4j stores data in nodes connected by directed, typed relationships with properties on both, also known as a Property Graph. It is a high performance graph store with all the features expected of a mature and robust database, like a friendly query language and ACID transactions.
Dgraph
Dgraph's goal is to provide Google production level scale and throughput, with low enough latency to be serving real time user queries, over terabytes of structured data. Dgraph supports GraphQL-like query syntax, and responds in JSON and Protocol Buffers over GRPC and HTTP.
JanusGraph
It is a scalable graph database optimized for storing and querying graphs containing hundreds of billions of vertices and edges distributed across a multi-machine cluster. It is a transactional database that can support thousands of concurrent users executing complex graph traversals in real time.
