November 10, 2025Proceedings of the ACM on Management of DataOpen Access

On the Expressiveness of Languages for Querying Property Graphs in Relational Databases

View Full Paper

Ask AI

Bookmark

Authors

HRHadar RotschieldHebrew University of Jerusalem LPLiat Peterfreund

Discussion

Member takes

Implication

Analysis reveals that SQL/PGQ's extended fragment captures all NL queries in property graph structures, indicating the importance of view definitions.

Key Points

Expressiveness of SQL/PGQ is intricately linked to graph creation and view construction in relational databases.
The research identifies a strict hierarchy of SQL/PGQ fragments, highlighting the roles of read-only and read-write components.
Analysis indicates that allowing higher arities beyond arity-2 does not enhance power in ordered structures.
Understanding this hierarchy of expressiveness may influence future developments in querying property graphs.

Cite This Study

Rotschield et al. (2025) studied this question.

synapsesocial.com/papers/69253a31c0ce034ddc357858 https://doi.org/10.1145/3767715

View Full Paper

Ask AI

Bookmark

Implication

Analysis reveals that SQL/PGQ's extended fragment captures all NL queries in property graph structures, indicating the importance of view definitions.

On the Expressiveness of Languages for Querying Property Graphs in Relational Databases

Discussion

Member takes

Implication

Key Points

Cite This Study

On the Expressiveness of Languages for Querying Property Graphs in Relational Databases

Discussion

Member takes

Implication

Key Points

Cite This Study

Also Consider

Also Consider