Search Results

Documents authored by Rotschield, Hadar

Artifact
Software
DOI: 10.4230/artifacts.25284
Order-Constrained-Paths-in-Leveled-Graphs

Authors: Hadar Rotschield and Liat Peterfreund

Abstract
Cite as

Hadar Rotschield, Liat Peterfreund. Order-Constrained-Paths-in-Leveled-Graphs (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-25284,
   title = {{Order-Constrained-Paths-in-Leveled-Graphs}}, 
   author = {Rotschield, Hadar and Peterfreund, Liat},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:30effa7157a9e9bbf79b73b574a5189d5b5abef4;origin=https://github.com/hadarrot/Order-Constrained-Paths-in-Leveled-Graphs;visit=swh:1:snp:1120381b15e914372a36ff8bda26c5bbe906d092;anchor=swh:1:rev:75ee488b368e427fa88701c8b139104753fbeb25}{\texttt{swh:1:dir:30effa7157a9e9bbf79b73b574a5189d5b5abef4}} (visited on 2026-03-18)},
   url = {https://github.com/hadarrot/Order-Constrained-Paths-in-Leveled-Graphs},
   doi = {10.4230/artifacts.25284},
}
Document
Database Theory in Action
DOI: 10.4230/LIPIcs.ICDT.2026.26
Database Theory in Action: From Inexpressibility to Efficiency in GQL’s Order-Constrained Paths

Authors: Hadar Rotschield and Liat Peterfreund

Published in: LIPIcs, Volume 365, 29th International Conference on Database Theory (ICDT 2026)

Abstract
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.
Cite as

Hadar Rotschield and Liat Peterfreund. Database Theory in Action: From Inexpressibility to Efficiency in GQL’s Order-Constrained Paths. In 29th International Conference on Database Theory (ICDT 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 365, pp. 26:1-26:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{rotschield_et_al:LIPIcs.ICDT.2026.26,
  author =	{Rotschield, Hadar and Peterfreund, Liat},
  title =	{{Database Theory in Action: From Inexpressibility to Efficiency in GQL’s Order-Constrained Paths}},
  booktitle =	{29th International Conference on Database Theory (ICDT 2026)},
  pages =	{26:1--26:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-413-0},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{365},
  editor =	{ten Cate, Balder and Funk, Maurice},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2026.26},
  URN =		{urn:nbn:de:0030-drops-256408},
  doi =		{10.4230/LIPIcs.ICDT.2026.26},
  annote =	{Keywords: Property graphs, ISO GQL, Graph Query Languages, Pattern Matching}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact