Show HN: TuringDB – The fastest analytical in-memory graph database in C++ (opens in new tab)

***Benchmark summary (TuringDB vs Neo4j)***

We benchmarked TuringDB against Neo4j using the Reactome biological knowledge graph, which is a real-world, highly connected dataset (millions of nodes/edges, deep traversal patterns).

- Both systems were run out of the box, cold start.

- No manual indexing, tuning, or query rewriting on either side.

- Same logical queries, same dataset.

- Benchmarks are reproducible via an open-source runner.

Multi-hop traversal from a small seed set (15 nodes):

- 1–4 hops: ~110×–130× faster

- 7 hops: ~300× faster

- 8 hops: ~200× faster

Example:

- Neo4j: ~98s for an 8-hop traversal

- TuringDB: ~0.48s for the same query

Label scans and label-constrained traversals:

- Simple label scan (`match (n:Drug)`): ~1200× faster

- Multi-label scan: up to ~4000× faster

More complex bidirectional traversals:

- Speedups range from ~6× to ~600× depending on query shape and result materialisation.

Why the difference exists:

The speedups are not from query tricks, but from architectural choices:

- *Column-oriented execution*: vectorized, SIMD-friendly scans instead of record-at-a-time execution.

- *Streaming traversal engine*: processes node/edge chunks in batches rather than pointer chasing one node at a time.

- *Immutable snapshots*: no read locks, no coordination overhead during deep analytical queries.

- *Graph-native storage*: traversal is the primary access path, not an emergent property of joins.

Neo4j’s record-oriented model performs reasonably for short traversals but degrades sharply on long paths and broad scans, especially on cold starts.

Scope and caveats:

- These benchmarks focus on *analytical read-heavy workloads*, not high-write OLTP scenarios.

- We’re not claiming universal superiority, different workloads want different systems.

- The full benchmark code and instructions are public and reproducible:

https://github.com/turing-db/turing-bench

This is not meant to replace transactional graph databases or general-purpose OLTP systems. It’s designed for large, read-heavy analytical graphs where latency, explainability, and control matter more than write throughput. The exact applications that blocked us when doing biomedical digital twins & large knowledge graphs.

Feedback always welcome.

Some extra context and technical details for those interested.

We built TuringDB because our workloads were dominated by analytical graph queries (multi-hop traversals, neighborhood expansion, similarity analysis) on large, relatively stable graphs, extracted from scientific literature. After all, scientists don’t publish millions of new papers per second (yet). Write transactions throughput was not the bottleneck, it was latency when you need to go deep.

A few design choices that may be of interest:

- Column-oriented graph storage

Nodes, edges and properties are stored all adjacently column-wise to maximise cache locality during traversals. This isn’t a relational system with joins layered on top, and nodes & edges are not their own distinct heap-allocated objects like in Neo4J or Memgraph, all of them are stored together in big columnar storage, for memory efficiency and decrease the amount of random pointer-chasing done by the engine. Property values are also stored all together column-wise for all the nodes & edges so filtering nodes by property value is quite fast out of the box even without any index.

We also implemented a streaming query engine for Cypher from scratch so that nodes and edges are processed by chunks in a streaming fashion to maximise cache efficiency.

- Immutable snapshots and lock-free reads

Every read query runs against a consistent immutable snapshot of the graph. Reads are never locked, and writes never block reads. We eliminated all the locks on the read path once a snapshot is acquired. By comparison, Memgraph has to acquire a lock on each node & edge when traversing graphs from node to node. Mutexes cost CPU cycles.

This makes long-running analytical queries predictable and avoids performance cliffs under concurrency.

- Versioning as part of the storage model

Every change creates a commit just like in git. You can query any historical version of the graph at full speed, branch datasets for experiments or simulations, and merge changes back. This is critical for regulated or safety-critical domains where auditability and reproducibility matter.

- We like C++ and TuringDB was born as an experiment in design space

The engine is written in C++ from scratch because we like C++ and it’s fun.

We implemented our own storage engine, query engine and column format from the ground up. We wanted to bring columnar storage and column-oriented streaming query execution to the world of graph databases. We wanted to make a graph DB that’s heavily focused on read intensive workloads for once, instead of transactional performance. In that sense TuringDB is also an experiment in the space of possible designs for a graph database engine.

We believe in paying very careful attention to memory layout, clear execution paths, not using any external magic that has not been thought through for what we want to build.

- Knowledge graphs and GraphRAG

A common use case is grounding LLMs in structured graph context rather than relying on text-only retrieval. We’re shipping native vector search and embeddings inside TuringDB this week so graph traversal and vector similarity can be combined in one system.