GraphForge vs. TypeDB

How do strongly typed relations compare with property graph flexibility?

TypeDB models data as entities, relations, and attributes, with roles, inheritance, and n-ary relations checked against a schema. TypeQL functions handle reasoning and recursion. Version 3.0 rewrote it in Rust. GraphForge uses a property graph with openCypher: looser typing, plus 94 algorithms and an investigation history. The choice is between enforcing meaning in the schema and analyzing structure with algorithms.

Products compared
GraphForgeTypeDB
ModelEmbedded property graphTyped entity-relation-attribute model
Version0.5.2 stable · 0.6.0-rc.523.13.6 (2026-09-22)18
LicenseApache-2.0 (since 0.5.0)MPL-2.0 (Community Edition); commercial Cloud and Enterprise
StatusActively maintained2Actively maintained18

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

On this page

Should I choose TypeDB or GraphForge?

TypeDB when a typed schema must enforce meaning; GraphForge when you analyze structure with algorithms.

Choose GraphForge when

  • You need graph algorithms; TypeDB documents no algorithm library.
  • You want an in-process engine today; embedded TypeDB is listed as coming soon.
  • You want openCypher and Arrow results rather than a dedicated query language.

Choose TypeDB when

  • Correctness depends on a rich schema of types, roles, and inheritance that the database must enforce.
  • Relationships naturally involve more than two participants and need n-ary relations.
  • Reasoning such as transitive closure should be expressed as typed functions in the query language.

What can each one do?

25 of 26 capabilities differ. For 15, TypeDB'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 TypeDB's primary documentation. It does not mean TypeDB lacks it.

CapabilityGraphForgeTypeDB
Property graph modelShippedPartial
Embedded / in-processShippedNo
Graph algorithmsShippedNot established
Distributed clusterNot plannedPartial
ProvenanceShippedNot established
Capabilities of GraphForge and TypeDB, with release status and sources
CapabilityGraphForgeTypeDB
Storage
Property graph modelShipped

Labeled property graph with typed properties.

1
Partial

Typed hypergraph: n-ary relations with roles, attributes as typed instances; not a labeled property graph.

1722
Document modelNot offered

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

1
Not established

Vendor claims document strengths; no schemaless document store documented.

Relational tablesNot offered

Not a relational database; results arrive as Arrow tables.

1
Not established

Vendor claims relational strengths; no SQL or table model documented.

Key-value accessNot offered

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

1
Not established

Not documented.

Columnar storageShipped

Durable projects store graph data as Arrow and Parquet.

4
Not established

Not documented.

Vector searchShipped

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

5
Partial

Native vector type and cosine similarity search in alpha preview for limited early testers.

27
Full-text searchShipped

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

5
Not established

No full-text index or ranking documented.

GeospatialNot offered

No spatial types or indexes are documented.

Not established

Not documented.

Execution
Transactional workloads (OLTP)Partial

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

6
Yes

Read, write and schema transactions over snapshots; writes may fail on commit conflicts.

23
Analytical workloads (OLAP)Shipped

Analytical verbs and Cypher over a local columnar project.

7
Not established

No analytical engine documented in 3.x.

Graph traversalShipped

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

8
Yes

TypeQL match patterns over relations and roles, with polymorphic subtype retrieval.

1722
Variable-length pathsShipped

Bounded and unbounded patterns and shortestPath().

8
Partial

No path quantifier syntax; transitive reachability written as recursive, tabled functions.

21
Graph algorithmsShipped

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

37
Not established

No graph-algorithm library documented.

Incremental computationNot offered

Algorithms recompute on request; no incremental mode is documented.

7
Not established

Functions compute at query time; no incremental view maintenance documented.

Deployment
Embedded / in-processShipped

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

9
No

Embedded TypeDB is marked 'Coming soon' on the official site.

26
Server modePlanned

Optional remote peer extension planned after 0.6.0.

11
Yes

TypeDB CE runs locally or in Docker as a server.

17
WebAssemblyNot planned

A browser WebAssembly engine was declined in ADR 0027.

12
Not established

Not documented.

Distributed clusterNot planned

Distributed clusters and HA replication are out of scope.

9
Partial

3.x Raft clustering is alpha and experimental; docs say not for production.

25
Managed cloudNot planned

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

13
Yes

TypeDB Cloud is fully managed on GCP or AWS.

26
Investigation
BranchingExperimental

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

14
Not established

Not documented.

Snapshots / time travelShipped

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

3
Not established

Not documented.

Immutable historyShipped

Knowledge ledger records immutable assertions and evidence lineage.

16
Not established

Not documented.

ProvenanceShipped

Provenance and knowledge ledger with evidence lineage.

16
Not established

Not 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 guarantees up to snapshot isolation.

23
ReplicationNot planned

HA replication is out of scope.

9
Partial

Raft replication with primary and secondary replicas, only in alpha clustered deployments.

25

Showing 26 of 26 capabilities.

How is each one built?

TypeDB: typed entity-relation-attribute model. 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.

TypeDB

TypeDB is a Rust server storing data in RocksDB, with a type system of entities, relations bound to role interfaces, and attributes. Functions, which replaced TypeDB 2 rules, are called explicitly, and recursive functions table their results to break cycles. Clustering replicates with Raft and is alpha in 3.x.

TypeDB rejects data that does not match the schema. GraphForge keeps the graph flexible and records evidence and hypotheses about it. Teams sometimes want both: a typed system of record and an analytical graph exported from it.

What the documentation says about TypeDB

  • TypeDB 3.0, announced on 2025-02-11, re-implemented the database in Rust.19
  • TypeDB 3 functions replace TypeDB 2 rules as the way to reason over data.20
  • TypeDB tables recursive functions to break cycles, and recommends a left-recursive form for transitive closure.21
  • Schemas subtype three root types: entities, relations that depend on role interfaces, and attributes owned by entities or relations.17
  • Relations can connect any number of entities or attributes, so relations are n-ary rather than binary.22
  • TypeDB CE is open source under the Mozilla Public License 2.0.22
  • TypeDB uses RocksDB as an embedded storage engine for durable persistence.22
  • Clustered TypeDB replicates data with the Raft consensus algorithm, with a primary replica serving strongly consistent operations.25
  • Since 3.4.0, export produces a TypeQL schema file plus a version-independent binary data file for import into other TypeDB versions.24

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 TypeDB. 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
JOINMulti-relation pattern matchingLatency, rows/sNot run
ALGOPageRank, WCC, SCC, Louvain, SSSPTime, memory, correctnessNot run
DURABLERestart, recovery, persistenceRecovery time, data integrityNot run

Which graph algorithms ship?

GraphForge: 94 native algorithms. TypeDB: no named algorithm library in its docs.

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)

TypeDB

No graph-algorithm library; reasoning and recursive computations such as transitive closure are written as user-defined TypeQL functions.2021

Delivered as: n/a

No named algorithm catalog was found in the primary documentation.

Where can each one run?

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

ModeGraphForgeTypeDB
Embedded / in-processShipped

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

9
No

Embedded TypeDB is marked 'Coming soon' on the official site.

26
Server modePlanned

Optional remote peer extension planned after 0.6.0.

11
Yes

TypeDB CE runs locally or in Docker as a server.

17
WebAssemblyNot planned

A browser WebAssembly engine was declined in ADR 0027.

12
Not established

Not documented.

Distributed clusterNot planned

Distributed clusters and HA replication are out of scope.

9
Partial

3.x Raft clustering is alpha and experimental; docs say not for production.

25
Managed cloudNot planned

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

13
Yes

TypeDB Cloud is fully managed on GCP or AWS.

26
ReplicationNot planned

HA replication is out of scope.

9
Partial

Raft replication with primary and secondary replicas, only in alpha clustered deployments.

25

What will my team write?

GraphForge: openCypher from Python, Node.js, Rust. TypeDB: TypeQL.

TypeDB developers write TypeQL against a server, using drivers for Python, Rust, Java, C, C#, and TypeScript over HTTP. GraphForge developers write openCypher in-process from Python, Node.js, or Rust.

Query languages
GraphForge openCypher
TypeDB TypeQL
SDKs and bindings
GraphForge Python, Node.js, Rust
TypeDB Python, TypeScript (HTTP), Rust, Java, C, C#
Written in
GraphForge Rust
TypeDB Rust
Surfaces
GraphForge Python, Node.js, Rust crates, CLI, VS Code extension, Notebooks, Agent skills

What are the trade-offs?

TypeDB has no algorithm library or embedded mode yet. GraphForge has no schema-enforced types or n-ary relations.

A fair assessment cuts both ways.

GraphForge

  • No schema-enforced types, roles, or n-ary relations; relationships are binary edges with properties.
  • No inference or rule functions.
  • No server or cluster.

TypeDB

  • Clustering in TypeDB 3.x is in alpha, and the docs ask users not to run the experimental clustered version in production.25
  • Embedded, in-application TypeDB is listed as 'Coming soon' rather than available.26
  • Native vector search is an alpha/experimental feature offered to a limited number of early testers.27
  • Unlike TypeDB 2 rules, functions do not silently infer new instances; each inference must be called explicitly as a function.20
  • Isolation is snapshot-level, and concurrent write transactions touching the same data may fail on commit.23

How would I migrate?

Load TypeDB data through Arrow, pandas, or Polars. TypeQL 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 TypeDB

  • TypeDB 2.x databases move to 3.x through the export/import path, since the data layers are incompatible.24
  • TypeQL is the only query language, so property-graph or relational data must be remodelled into entity, relation and attribute types with roles.17
  • TypeDB 3 drivers drop sessions and the per-query-type methods in favour of opening read/write/schema transactions and calling transaction.query().28

What else do people ask about TypeDB?

Is TypeDB a graph database? TypeDB uses a typed entity-relation model, not a property graph; embedded TypeDB is listed as coming soon.

Is TypeDB a graph database?

TypeDB describes a typed entity-relation-attribute model rather than a property graph. Relations are n-ary and role-based, which is more expressive than binary edges but differs from property graph tools.

Can TypeDB run embedded?

Not yet. The official site lists embedded TypeDB as coming soon. GraphForge is embedded by design.

Does GraphForge enforce a schema like TypeDB?

No. GraphForge uses a labeled property graph with typed property values but no schema-enforced roles or inheritance. It records provenance and hypotheses instead.

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. typedb/typedb README — GitHub
  18. Release TypeDB 3.13.6 — typedb/typedb GitHub
  19. TypeDB 3.0 is now live — TypeDB Blog
  20. Functions v/s rules — TypeDB Docs
  21. Functions — TypeDB Docs (core concepts)
  22. Features — TypeDB
  23. Transactions — TypeDB Docs
  24. Database Export & Import — TypeDB Docs
  25. Clustered TypeDB (Experimental) — TypeDB Docs
  26. TypeDB homepage
  27. Previewing the new native vector search — TypeDB Blog
  28. TypeDB 2.x vs 3.x differences — TypeDB Docs

Try GraphForge on your own graph.

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