What question did this study set out to answer?

To address limitations in GQL's ability to check increasing edge values along paths and improve expressiveness and efficiency.

March 21, 2026Open Access

Database Theory in Action: From Inexpressibility to Efficiency in GQL’s Order-Constrained Paths

View Full Paper

Ask AI

Bookmark

Authors

Constructive translation improves path constraint performance in property graphs, indicating significant efficiency advantages.

To address limitations in GQL's ability to check increasing edge values along paths and improve expressiveness and efficiency.
Developed a translation to compile increasing-edges conditions into the input graph.
Implemented a proof-of-concept translation in Neo4j's Cypher.
Compared performance between standard GQL queries and the compiled version.
The compiled version demonstrated faster execution times compared to traditional methods.
Avoided timeouts that occurred with standard GQL querying.
Restored expressiveness while enhancing practical performance.

Rotschield et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark