GraphForge vs. OrientDB

What is the migration path from an established multimodel graph system?

OrientDB combines documents and graphs, using record links instead of joins, with a SQL dialect, MATCH patterns, and Gremlin. SAP open-sourced its Enterprise edition under Apache 2.0 and ended maintenance in December 2023. The community now ships 3.2.x patch releases while 4.0 is in development. For OrientDB users, the question is where to go next. GraphForge is one option for the analytical part of that workload.

Products compared
GraphForgeOrientDB
ModelEmbedded property graphDocument + graph
Version0.5.2 stable · 0.6.0-rc.523.2.57 (2026-10-05)18
LicenseApache-2.0 (since 0.5.0)Apache 2.0 (Community; former SAP Enterprise agent also open-sourced under Apache 2.0)
StatusActively maintained2Maintenance mode20

Researched 2026-10-19 · 28 primary sources · Head-to-head benchmarks not yet run

On this page

Should I choose OrientDB or GraphForge?

OrientDB while an existing app depends on it; GraphForge to move graph analysis onto an actively released engine.

Choose GraphForge when

  • You are moving graph analysis off OrientDB and want Cypher with a built-in algorithm library.
  • You need centrality and community detection, which OrientDB does not document.
  • You want a project with active stable releases and a published TCK result.

Choose OrientDB when

  • An existing application depends on OrientDB's document and graph model, and 3.2.x patches are enough.
  • You need a JVM-embedded database with SQL-style queries and record links.
  • You are tracking the community 4.0 release and its distributed work.

What can each one do?

21 of 26 capabilities differ. For 12, OrientDB's docs did not confirm support, so they are marked Not established rather than No.

Each capability has a status and a source. “Not established” means we could not confirm the feature from OrientDB's primary documentation. It does not mean OrientDB lacks it.

CapabilityGraphForgeOrientDB
Document modelNot offeredYes
Embedded / in-processShippedYes
Graph algorithmsShippedPartial
Distributed clusterNot plannedPartial
ProvenanceShippedNot established
Capabilities of GraphForge and OrientDB, with release status and sources
CapabilityGraphForgeOrientDB
Storage
Property graph modelShipped

Labeled property graph with typed properties.

1
Yes

Native graphs; connections stored as persistent pointers between records.

17
Document modelNot offered

No document-store model; properties accept nested, heterogeneous values.

1
Yes

Document model with schema-less, schema-full and schema-mixed modes.

17
Relational tablesNot offered

Not a relational database; results arrive as Arrow tables.

1
Partial

SQL dialect for querying, but README states it is not a relational DBMS.

17
Key-value accessNot offered

No key-value API; data is a property graph.

1
Not established

No dedicated key-value model confirmed in current primary docs.

Columnar storageShipped

Durable projects store graph data as Arrow and Parquet.

4
Not established

No columnar storage documented.

Vector searchShipped

Exact cosine retrieval over embeddings you supply; no ANN index.

5
Not established

No vector index found in docs or recent release notes.

Full-text searchShipped

Tantivy-backed BM25; hybrid text and vector retrieval through find().

5
Yes

README and repo description list full-text search / full-text indexing.

17
GeospatialNot offered

No spatial types or indexes are documented.

Yes

README lists native Geo-Spatial support among its models.

17
Execution
Transactional workloads (OLTP)Partial

Local analytical scope; durable atomic writes with queued and optimistic writer modes.

6
Yes

ACID transactions with optimistic MVCC.

25
Analytical workloads (OLAP)Shipped

Analytical verbs and Cypher over a local columnar project.

7
Not established

No analytical engine documented.

Graph traversalShipped

Cypher MATCH patterns plus BFS, DFS, Dijkstra, A*, and reachability.

8
Yes

SQL MATCH pattern matching, TRAVERSE, and out()/in()/both() functions.

2223
Variable-length pathsShipped

Bounded and unbounded patterns and shortestPath().

8
Yes

MATCH while: conditions and maxDepth; $depth usable in conditions.

23
Graph algorithmsShipped

94 native algorithms behind analysis verbs, not Cypher CALL procedures.

37
Partial

Only path functions built in: shortestPath(), dijkstra(), astar(); no centrality/community library found.

22
Incremental computationNot offered

Algorithms recompute on request; no incremental mode is documented.

7
Not established

Reactive (live) queries exist; no incremental computation documented.

Deployment
Embedded / in-processShipped

In-process library; no server, daemon, or connection string.

9
Yes

Runs inside a JVM app: embedded server or direct local-mode database access.

27
Server modePlanned

Optional remote peer extension planned after 0.6.0.

11
Yes

Standalone server reached via remote connections; Console and Studio work against it.

27
WebAssemblyNot planned

A browser WebAssembly engine was declined in ADR 0027.

12
Not established

No WebAssembly build documented; JVM-only.

Distributed clusterNot planned

Distributed clusters and HA replication are out of scope.

9
Partial

Multi-master with Hazelcast; app-chosen sharding; sharded UNIQUE indexes not guaranteed unique.

26
Managed cloudNot planned

No hosted compute. The graphforge.sh Hub distributes repositories; execution stays local.

13
Not established

No managed cloud offering found on the project site.

Investigation
BranchingExperimental

Research versions, branches, slices, proposals, and forks ship in 0.6.0 release candidates.

14
Not established

No branching feature documented.

Snapshots / time travelShipped

Named checkpoints you can diff and revert, plus transaction-time snapshots.

3
Not established

No as-of / time-travel queries documented.

Immutable historyShipped

Knowledge ledger records immutable assertions and evidence lineage.

16
Not established

No immutable history feature documented.

ProvenanceShipped

Provenance and knowledge ledger with evidence lineage.

16
Not established

No provenance tracking documented.

Competing hypothesesShipped

Immutable hypothesis groups with membership and selection events.

3
Not established
Operations
ACID transactionsPartial

Acknowledged-durable atomic publication; docs do not claim general ACID or serializable isolation.

6
Yes

ACID; READ COMMITTED default, REPEATABLE READ only for plocal/memory, not remote.

25
ReplicationNot planned

HA replication is out of scope.

9
Yes

Multi-master replication plus read-only REPLICA servers; majority writeQuorum advised.

26

Showing 26 of 26 capabilities.

How is each one built?

OrientDB: document + graph. GraphForge: an embedded property graph library in Rust, persisted as Parquet.

GraphForge

GraphForge is a Rust library that runs inside your process: no daemon, server, or connection string. Projects persist to a local directory as Arrow and Parquet data plus JSON metadata, and every query and analysis verb returns an Apache Arrow table. Algorithms run in the same native engine as Cypher and are called as API verbs (rank, cluster, paths, analyze, similar), not as Cypher procedures.

OrientDB

OrientDB is a Java multimodel database that can run as a server or be embedded in a JVM application. Records link directly to other records, so graph edges are pointers rather than joins. Multi-master distribution uses Hazelcast, and applications choose their sharding.

OrientDB is a general application database that can model graphs. GraphForge is an analytics engine for graphs only, so migration usually means exporting the graph portion and leaving document storage elsewhere.

What the documentation says about OrientDB

  • SAP transitioned SAP Enterprise OrientDB to open source under Apache 2.0 and ended its maintenance on 31 December 2023.19
  • SAP's announcement states the future roadmap will be determined and driven by the OrientDB open-source community.19
  • In 2025 the project shipped 12 patch releases, all on the maintenance line, with four non-bot commit authors per branch.21
  • Version 4.0 is in development; the Q3 2026 update names a new configuration format as a key missing piece before beta packages.20
  • Gremlin support ships as a separate Apache TinkerPop 3-enabled distribution with an embedded Gremlin Server.24
  • SQL MATCH provides declarative pattern matching, introduced in v2.2; since v3.0 it returns duplicates unless DISTINCT is used.23
  • Built-in SQL graph functions include shortestPath(), dijkstra() and astar() for weighted path-finding.22
  • The OrientDB server can be embedded in a Java application via OServerMain.create(), allowing concurrent local and remote access.27

Which one is faster?

Not measured yet. No head-to-head run has been published, so this page shows no performance chart.

Charts appear only after a reproducible run exists: pinned versions, disclosed hardware, generated data, raw results, and scripts.

No comparative results yet

The suites below apply to GraphForge and OrientDB. Each will be reported separately per benchmark class, never merged into one leaderboard.

Ingestion and writes

SuiteWorkloadsMetricsStatus
INGESTCSV, JSONL, Parquet, graph edge listsRecords/s, MB/s, total elapsedNot run

Query, analytics, and system

SuiteWorkloadsMetricsStatus
LOOKUPID lookup, indexed property filterp50/p95/p99 latencyNot run
TRAVERSEBFS, k-hop, variable-length pathLatency, visited edges/sNot run
ALGOPageRank, WCC, SCC, Louvain, SSSPTime, memory, correctnessNot run
EMBEDStartup, load, reopen, binary sizems, MiB, disk footprintNot run

Which graph algorithms ship?

GraphForge: 94 native algorithms. OrientDB: 3 named in its docs, delivered as bundled.

Algorithms are listed by name, as documented. Counts of extension modules or third-party libraries are not presented as native coverage.

GraphForge

94 Rust algorithms run in the engine behind five analysis verbs (rank, cluster, paths, analyze, similar) and return Arrow tables.37

A selection of the catalog:

  • PageRank
  • ArticleRank
  • Betweenness (Brandes)
  • Closeness
  • Harmonic closeness
  • Eigenvector
  • HITS
  • CELF influence maximization
  • Triangle count
  • K-core decomposition
  • Louvain
  • Leiden
  • Label propagation
  • Infomap
  • Walktrap
  • Girvan-Newman
  • Weakly connected components
  • Strongly connected components
  • Dijkstra
  • A*
  • Bellman-Ford
  • Yen's k-shortest paths
  • Max flow / min cut
  • Steiner tree
  • Minimum spanning tree
  • Topological sort
  • Node2Vec
  • GraphSAGE
  • Fast random projection
  • Node similarity (Jaccard)

OrientDB

No algorithm library; path-finding is exposed as built-in SQL functions alongside MATCH/TRAVERSE.22

Delivered as: bundled

  • shortestPath
  • Dijkstra
  • A*

Where can each one run?

GraphForge runs in-process only. OrientDB: embedded yes, server yes, cluster partial.

ModeGraphForgeOrientDB
Embedded / in-processShipped

In-process library; no server, daemon, or connection string.

9
Yes

Runs inside a JVM app: embedded server or direct local-mode database access.

27
Server modePlanned

Optional remote peer extension planned after 0.6.0.

11
Yes

Standalone server reached via remote connections; Console and Studio work against it.

27
WebAssemblyNot planned

A browser WebAssembly engine was declined in ADR 0027.

12
Not established

No WebAssembly build documented; JVM-only.

Distributed clusterNot planned

Distributed clusters and HA replication are out of scope.

9
Partial

Multi-master with Hazelcast; app-chosen sharding; sharded UNIQUE indexes not guaranteed unique.

26
Managed cloudNot planned

No hosted compute. The graphforge.sh Hub distributes repositories; execution stays local.

13
Not established

No managed cloud offering found on the project site.

ReplicationNot planned

HA replication is out of scope.

9
Yes

Multi-master replication plus read-only REPLICA servers; majority writeQuorum advised.

26

What will my team write?

GraphForge: openCypher from Python, Node.js, Rust. OrientDB: OrientDB SQL (with MATCH and TRAVERSE), Gremlin (TinkerPop 3 distribution).

OrientDB developers write OrientDB SQL with MATCH and TRAVERSE, or Gremlin through a separate TinkerPop distribution, from Java or community drivers. GraphForge uses openCypher from Python, Node.js, or Rust.

Query languages
GraphForge openCypher
OrientDB OrientDB SQL (with MATCH and TRAVERSE), Gremlin (TinkerPop 3 distribution)
SDKs and bindings
GraphForge Python, Node.js, Rust
OrientDB Java (native / embedded), Node.js (OrientJS), Python (pyorient), PHP (PhpOrient), .NET
Written in
GraphForge Rust
OrientDB Java
Surfaces
GraphForge Python, Node.js, Rust crates, CLI, VS Code extension, Notebooks, Agent skills

What are the trade-offs?

OrientDB is community-maintained with 4.0 still pre-beta. GraphForge has no document model, Java binding, or server.

A fair assessment cuts both ways.

GraphForge

  • No document model or record links; GraphForge stores a property graph only.
  • No Java binding.
  • No server or multi-master mode.

OrientDB

  • Distributed-mode work for 4.0 is still being tested, with roughly two thirds of existing distributed integration tests passing.20
  • In sharded clusters a UNIQUE index does not guarantee key uniqueness, and some aggregates such as AVG() do not merge across shards.26
  • Over the remote protocol only READ COMMITTED isolation is available, and transactions are held in client RAM.25
  • No built-in centrality or community-detection algorithms; only path-finding functions are documented.22
  • The 2025 stats post says most develop-branch work is untested in production and has not yet reached users.21

How would I migrate?

Load OrientDB data through Arrow, pandas, or Polars. OrientDB SQL queries are rewritten as Cypher.

Into GraphForge

  • GraphForge 0.5.x loads data through Arrow, pandas, and Polars bulk calls or Cypher scripts; it has no native CSV loader.15
  • Algorithms are API verbs (rank, cluster, paths, analyze, similar), not Cypher CALL procedures, so procedure calls become verb calls.7
  • GraphForge passes the full openCypher 2024.3 TCK, so standard openCypher queries are the portable part of a migration.10

Moving from OrientDB

  • OrientDB SQL is a proprietary dialect; the TinkerPop 3 distribution offers Gremlin as a more portable traversal language.24
  • ArcadeDB describes itself as a conceptual fork of OrientDB that reuses a heavily modified OrientDB SQL engine, making it a closer migration target.28
  • Planned 4.0 work removes deprecated APIs with most breaking API changes already done, so embedded Java users should expect API migration.21

What else do people ask about OrientDB?

Is OrientDB still maintained? OrientDB is community-maintained since SAP stepped back; ArcadeDB suits applications, GraphForge the analysis.

Is OrientDB still maintained?

Yes, by its community. SAP ended its maintenance on 31 December 2023 and open-sourced the Enterprise edition. 3.2.x patch releases continue, and 4.0 has not reached beta.

Is ArcadeDB the successor to OrientDB?

ArcadeDB describes itself as a conceptual fork of OrientDB and offers an OrientDB importer, so it is the most direct path for applications. GraphForge is an option for the analytical graph workload.

How do I move an OrientDB graph into GraphForge?

Export vertices and edges, for example to JSON, load them into dataframes, and publish them into a GraphForge project. SQL MATCH and Gremlin traversals need to be rewritten in Cypher.

How was this researched?

From 28 primary sources, accessed 2026-10-19, each cited where it is used.

Capabilities were checked against primary documentation, repositories, and release notes, accessed 2026-10-19. Each cell records two things: the capability’s state and the evidence behind it. Every GraphForge cell carries a release status. Shipped means stable 0.5.2; experimental means 0.6.0 release candidates only. GraphForge is pre-1.0 and makes no backward-compatibility guarantee yet.

  • Yes documented natively
  • Partial limited or caveated
  • Extension official extension or module
  • Paid edition paid or enterprise edition only
  • Removed removed, with the version cited
  • Not established not confirmed by our research; not a “no”
  • Shipped in stable 0.5.2
  • Partial shipped with documented limits
  • Experimental in 0.6.0 release candidates only
  • Planned on the roadmap
  • Not offered outside the product's model
  • Not planned explicitly out of scope

Benchmark classes

  1. Equivalent workloads. The same logical operation with the same correctness requirement on every engine.
  2. Native optimized workloads. Each engine's best supported implementation, including projections, indexes, extensions, and native algorithms.
  3. End-to-end application workloads. Time from raw data to a usable result: import, indexing, projection, computation, and output retrieval.

Sources · accessed 2026-10-19

  1. GraphForge repository README — GitHub
  2. GraphForge releases — GitHub
  3. GraphForge 0.5.0 changelog — GitHub
  4. Storage architecture — GraphForge Book
  5. Analytics integration: search and retrieval — GraphForge Guide
  6. ADR 0018: acknowledged durability and isolation — GitHub
  7. Algorithm verbs — GraphForge Book
  8. Cypher guide — GraphForge Guide
  9. openCypher compatibility — GraphForge Reference
  10. openCypher TCK compliance — GraphForge Reference
  11. Remote authority peer extension (#215) — GitHub
  12. ADR 0027: native runtime boundary — GitHub
  13. Release scope and roadmap — GraphForge Docs
  14. Keep research history — GraphForge Guide
  15. Graph construction — GraphForge Guide
  16. Knowledge public API v1 — GraphForge Book
  17. orientechnologies/orientdb README — GitHub
  18. Release 3.2.57 — orientechnologies/orientdb on GitHub
  19. Enterprise agent open source — orientdb.dev
  20. OrientDB work in progress update 2026 Q3 — orientdb.dev
  21. OrientDB development statistics of 2025 — orientdb.dev
  22. SQL Functions — OrientDB 3.2.x manual
  23. SQL MATCH — OrientDB 3.2.x manual
  24. OrientDB TinkerPop 3 — OrientDB 3.2.x manual
  25. Transactions — OrientDB 3.2.x manual
  26. Distributed Architecture — OrientDB manual
  27. Embedded Server — OrientDB 3.2.x manual
  28. ArcadeData/arcadedb README — GitHub

Try GraphForge on your own graph.

Install the package, open a project, and run the same notebook we measure with.