GraphDB vs. HyperGraphDB vs. Oracle Spatial and Graph vs. RecallGraph Comparison Chart

HyperGraphDB is a general purpose, open-source data storage mechanism based on a powerful knowledge management formalism known as directed hypergraphs. While a persistent memory model designed mostly for knowledge management, AI and semantic web projects, it can also be used as an embedded object-oriented database for Java projects of all sizes. Or a graph database, or a (non-SQL) relational database. HyperGraphDB is a storage framework based on generalized hypergraphs as its underlying data model. The unit of storage is a tuple made up of 0 or more other tuples. Each such tuple is called an atom. One could think of the data model as relational where higher-order, n-ary relationships are allowed or as graph-oriented where edges can point to an arbitrary set of nodes and other edges. Each atom has an arbitrary, strongly-typed value associated with it. The type system managing those values is embedded as a hypergraph and customizable from the ground up.

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: 1. Both vertices and edges can hold properties in the form of attribute/value pairs (equivalent to JSON objects). 2. Documents (vertices/edges) mutate within their lifespan (both in their individual attributes/values and in their relations with each other). 3. Past states of documents are as important as their present, necessitating retention and queryability of their change history. Also see this blog post for an intro - https://blog.recallgraph.tech/never-lose-your-old-data-again.