RecallGraph Description
RecallGraph is a versioned graph data store. It retains all changes its data (vertices, edges) have undergone to get to their current state. It supports point-in time graph traversals that allow the user to query any past state of a graph as well as the present.
RecallGraph can be used in situations where data is best represented using a network of edges and vertices (i.e., as a graph).
1. Both edges and vertices can contain properties in the form attribute/value pairs (equivalent of JSON objects).
2. Documents (vertices/edges), can change throughout their lives (both in their individual attributes/values as well as in their relationships to each other).
3. Documents from the past are just as important as their current states, so it is essential to retain and queryable their change history.
Also see this blog post for an intro - https://blog.recallgraph.tech/never-lose-your-old-data-again.
RecallGraph Alternatives
ArangoDB
Natively store data for graphs, documents and search needs. One query language allows for feature-rich access. You can map data directly to the database and access it using the best patterns for the job: traversals, joins search, ranking geospatial, aggregateions - you name them. Polyglot persistence without the cost. You can easily design, scale, and adapt your architectures to meet changing needs with less effort. Combine the flexibility and power of JSON with graph technology to extract next-generation features even from large datasets.
Learn more
JanusGraph
JanusGraph is an optimized graph database that can store and query graphs with hundreds of billions of edges and vertices distributed across a multi-machine cluster. JanusGraph is a project of The Linux Foundation and includes participants from Expero and Google, GRAKN.AI., Hortonworks. IBM, and Amazon. Linear and elastic scaling for growing data and users. Data replication and data distribution for performance and fault tolerance. Hot backups and high availability for multi-datacenters All functionality is completely free. There is no need to purchase commercial licenses. JanusGraph is completely open source under the Apache 2 License. JanusGraph is an open source transactional database that can handle thousands of concurrent users performing complex graph traversals in real-time. ACID and eventual consistency support. JanusGraph offers online transactional processing (OLTP) and global graph analytics (OLAP), through its Apache Spark integration.
Learn more
Titan
Titan is a graph database that can store and query graphs with hundreds of billions of edges and vertices distributed across a multi-machine cluster. Titan is a transactional database which can handle thousands of concurrent users performing complex graph traversals in real-time. For a growing user and data base, you can use linear and elastic scaling. Data replication and data distribution for performance and fault tolerance. Hot backups and high availability for multi-datacenters Support for ACID, eventual consistency and other storage backends. Support for Apache Cassandra and Apache HBase storage backends, as well as Oracle BerkeleyDB. Integration with big data platforms such as Apache Spark, Apache Giraph, and Apache Hadoop allows for global graph data analytics, reporting and ETL. Native integration with TinkerPop graph stack to support Gremlin's graph query language, Gremlin's graph server, and Gremlin apps.
Learn more
Apache TinkerPop
Apache TinkerPop™, a graph computing framework, is available for graph databases (OLTP), and graph analytic system (OLAP). Apache TinkerPop's graph traversal language is Gremlin. Gremlin allows users to express complex traversals (or queries) on their application's property diagram in a concise, data-flow language. Each Gremlin traversal consists of a sequence (potentially nested). A graph is a structure that is composed of vertices or edges. Each edge and vertices can have an unlimited number of key/value pairs, called properties. Vertices can be used to denote discrete objects, such as a person or a place or an event. Edges denote relationships between vertices. A person might know another person, be involved in an event, or have been to a specific place recently. If a domain contains a heterogeneous set objects (vertices), that can be linked to one another in many ways (edges), it is called a domain.
Learn more
Pricing
Pricing Information:
https://recallgraph.tech/schedule
Free Version:
Yes
Integrations
API:
Yes, RecallGraph has an API
No Integrations at this time
Company Details
Company:
RecallGraph
Year Founded:
2020
Headquarters:
India
Website:
recallgraph.tech/
Media
Recommended Products
Secure your business by securing your people.
Take the guesswork out of password management, shadow IT, infrastructure, and secret sharing so you can keep your people safe and your business moving.
Product Details
Platforms
Windows
Mac
Linux
Type of Training
Documentation
Live Online
Webinars
Customer Support
Online
RecallGraph Features and Options
RecallGraph User Reviews
Write a Review- Previous
- Next