Graphs

The first results are published in November 2026: ArcadeDB 26.11.1 against a multi-model subset of engines, measured on the November instrument. Until then MMDBBench shows its method and its lanes, and no numbers.

The tasks come from the Linked Data Benchmark Council's Social Network Benchmark. The interactive half reads a graph at several depths: a point lookup, one hop, two hops, and a three-hop read with a property filter. It also inserts, updates and deletes.

The analytical half asks questions that touch the whole graph, such as the degree distribution and the triangle count. A triangle count returns one small number, so it is a strong answer check: if two engines disagree on it, one of them is wrong.

Each engine is asked in the language it is normally asked in. A query that exceeds its time budget is published as censored, with its budget, and is never dropped.

The lane will carry these tables:

• Graph interactive queries: point lookup, one hop, two hops, and a three-hop read with a property filter, with insert, update, and delete beside them. Warm medians, with the ninety-ninth percentile on the point lookup.
• Graph analytical queries: average friend age, friendships within a city, most friends, the degree distribution, and the triangle count. A query that exceeds its time budget is published as censored, with its budget and the iterations it reached.

The rules every result follows are in the methodology. The settings for each engine are on the engines page. If one is wrong, tell us.

• Tables: Documents and structured query language (SQL) analytics.
• Vectors: Dense and sparse vector search, with recall beside every latency.
• Time series: Monitoring-style queries over timestamped readings.
• Cross-model: One operation across a vector, a graph edge, and a document.
• Lifecycle: Opening, closing, deployment boundaries, and what waiting for the disk costs.