On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
Summary: Formalizes SQL/PGQ as views over relational data and analyzes three fragments—read-only core, read-write with graph creation, and an extended variant with arbitrary-arity identifiers—showing graph creation is the key driver of power. Establishes a strict hierarchy (read-only < read-write < extended), proves read-write is still below NL while the extended fragment exactly captures NL, and shows on ordered structures arity-2 identifiers suffice so the hierarchy collapses, linking the results to classical transitive-closure phenomena. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Hadar Rotschield (Hebrew University)
- 2. Liat Peterfreund (Hebrew University)
BibTeX Citation
@inproceedings{rotschield_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{On the Expressiveness of Languages for Querying Property Graphs in Relational Databases}},
url = {https://dl.acm.org/doi/10.1145/3767715},
doi = {10.1145/3767715},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Rotschield, Hadar and Peterfreund, Liat},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 312 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021733819 |
| 900 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.00013337186 |
| 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010318258 |
| 5,425 | GPC: A Pattern Calculus for Property Graphs | 2023 | PODS | 6.223218e-05 |
| 7,603 | GQL and SQL/PGQ: Theoretical Models and Expressive Power | 2025 | VLDB | 5.5853593e-05 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,661 | PG-Schema: Schemas for Property Graphs | 2023 | SIGMOD |
| 2 | 11,069 | Versatile Property Graph Transformations | 2025 | VLDB |
| 3 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 4 | 747 | Querying Graph Databases | 2013 | PODS |
| 5 | 2,986 | Tractable Query Languages for Complex Object Databases | 1991 | PODS |
| 6 | 9,682 | Graph Data Models, Query Languages and Programming Paradigms | 2018 | VLDB |
| 7 | 8,407 | On The Reasonable Effectiveness of Relational Diagrams: Explaining Relational Query Patterns and the Pattern Expressiveness of Relational Languages | 2024 | SIGMOD |
| 8 | 5,264 | Implementation Strategies for Views over Property Graphs | 2024 | SIGMOD |
| 9 | 5,425 | GPC: A Pattern Calculus for Property Graphs | 2023 | PODS |
| 10 | 7,603 | GQL and SQL/PGQ: Theoretical Models and Expressive Power | 2025 | VLDB |