Database Paper Browser

Back to papers

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)

Paper ID
1995
Venue
PODS
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,006 | 30.40%
DOI
10.1145/3767715

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

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
363 A Graphical Query Language Supporting Recursion 1987 SIGMOD 0.00025715157
964 G-CORE: A Core for Future Graph Query Languages 2018 SIGMOD 0.0001497475
1,812 Expressive Languages for Path Queries over Graph-Structured Data 2010 PODS 0.00010467069
5,651 GPC: A Pattern Calculus for Property Graphs 2023 PODS 5.3905536e-05
7,713 GQL and SQL/PGQ: Theoretical Models and Expressive Power 2025 VLDB 4.6712228e-05
Previous Page 1 / 1 Next

Semantically Similar Papers