GQL and SQL/PGQ: Theoretical Models and Expressive Power
Am\'elie Gheerbrant, Leonid Libkin, Liat Peterfreund, Alexandra Rogova

TL;DR
This paper provides a formal foundation for SQL/PGQ and GQL, analyzing their expressive power, identifying limitations, and supporting the need for language extensions through theoretical models and experimental validation.
Contribution
It introduces core formal models for GQL and PGQ, clarifies their differences, and highlights the expressiveness gaps and practical limitations of current standards.
Findings
Core models clarify language differences
Identified expressiveness gaps in standards
Experimental results show impractical workarounds
Abstract
SQL/PGQ and GQL are very recent international standards for querying property graphs: SQL/PGQ specifies how to query relational representations of property graphs in SQL, while GQL is a standalone language for graph databases. The rapid industrial development of these standards left the academic community trailing in its wake. While digests of the languages have appeared, we do not yet have concise foundational models like relational algebra and calculus for relational databases that enable the formal study of languages, including their expressiveness and limitations. At the same time, work on the next versions of the standards has already begun, to address the perceived limitations of their first versions. Motivated by this, we initiate a formal study of SQL/PGQ and GQL, concentrating on their concise formal model and expressiveness. For the former, we define simple core languages --…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Computational Techniques and Applications
