Database Theory in Action: From Inexpressibility to Efficiency in GQL's Order-Constrained Paths
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908743218757632 |
|---|---|
| author | Rotschield, Hadar Peterfreund, Liat |
| author_facet | Rotschield, Hadar Peterfreund, Liat |
| contents | Pattern matching of core GQL, the new ISO standard for querying property graphs, cannot check whether edge values are increasing along a path, as established in recent work. We present a constructive translation that overcomes this limitation by compiling the increasing-edges condition into the input graph. Remarkably, the benefit of this construction goes beyond restoring expressiveness. In our proof-of-concept implementation in Neo4j's Cypher, where such path constraints are expressible but costly, our compiled version runs faster and avoids timeouts. This illustrates how a theoretically motivated translation can not only close an expressiveness gap but also bring practical performance gains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_23330 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Database Theory in Action: From Inexpressibility to Efficiency in GQL's Order-Constrained Paths Rotschield, Hadar Peterfreund, Liat Databases Pattern matching of core GQL, the new ISO standard for querying property graphs, cannot check whether edge values are increasing along a path, as established in recent work. We present a constructive translation that overcomes this limitation by compiling the increasing-edges condition into the input graph. Remarkably, the benefit of this construction goes beyond restoring expressiveness. In our proof-of-concept implementation in Neo4j's Cypher, where such path constraints are expressible but costly, our compiled version runs faster and avoids timeouts. This illustrates how a theoretically motivated translation can not only close an expressiveness gap but also bring practical performance gains. |
| title | Database Theory in Action: From Inexpressibility to Efficiency in GQL's Order-Constrained Paths |
| topic | Databases |
| url | https://arxiv.org/abs/2512.23330 |