Metraipolis › archive › dc_d5db3bfacd6b
Relational-Core Graph Analytics Querying graphs at SQL scale, and why the node/edge model is a performance tax, not a truer picture of connected data — arXiv:2609.01525
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01525
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T06:34:25.214Z
- SHA-256 of the archived text
1b31a4f90ecac77a5d77dae3480be872fb93ba7af758afb285c07539735d8007- Stable URL of this page
https://metraipolis.com/documento/dc_d5db3bfacd6b
How to cite
Relational-Core Graph Analytics Querying graphs at SQL scale, and why the node/edge model is a performance tax, not a truer picture of connected data — arXiv:2609.01525 — arXiv (en), https://arxiv.org/abs/2609.01525 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d5db3bfacd6b (Metraipolis archive dc_d5db3bfacd6b, sha256 1b31a4f90ecac77a5d77dae3480be872fb93ba7af758afb285c07539735d8007)
BibTeX
@misc{dcd5db3bfacd6b,
title = {Relational-Core Graph Analytics Querying graphs at SQL scale, and why the node/edge model is a performance tax, not a truer picture of connected data — arXiv:2609.01525},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01525},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d5db3bfacd6b; sha256 1b31a4f90ecac77a5d77dae3480be872fb93ba7af758afb285c07539735d8007},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01525. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A durable assumption holds that graph analytics requires a purpose-built graph engine, and that relational systems are ill-suited to connected data. We argue the opposite for the workloads enterprises actually run. A columnar relational engine fronted by a graph query language matches or exceeds native graph engines on analytical graph queries, and - decisively - scales past the point where in-memory graph engines fail. We further argue that the node/edge property graph is not a more faithful model of connected data but a re-encoding of relationships that already exist explicitly in relational tables; reconstructing them at query time is pure overhead. We present ClickGraph and its Databricks-dialect sibling DeltaGraph, systems that translate Cypher directly onto the native relational schema - the tables, columns, and foreign keys as they already exist - and execute in place on ClickHouse, Databricks, or in-process on lakehouse files, with no import and no separate cluster. Because the output is ordinary SQL, an underperforming query is an open optimization surface: it can be rewritten, and the engine itself extended. We support the argument with a peer system's own published benchmark, in which a columnar engine outruns Neo4j by two-to-four orders of magnitude, and with reproducible measurements across the LDBC Social Network Benchmark suite. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-02 in cs.AI). Categorie arXiv: Databases (cs.DB) ; Artificial Intelligence (cs.AI); Programming Languages (cs.PL). Pagina del lavoro: https://arxiv.org/abs/2609.01525 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T06:15:12.908Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).