3 papers
cs.DB2026
Database Theory in Action: From Inexpressibility to Efficiency in GQL's Order-Constrained Paths
Hadar Rotschield, Liat Peterfreund
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 pre…
cs.DB2025
On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
Hadar Rotschield, Liat Peterfreund
SQL/PGQ is the emerging ISO standard for querying property graphs defined as views over relational data. We formalize its expressive power across three fragments: the read-only cor…
cs.DB2025
Towards Cross-Model Efficiency in SQL/PGQ
Hadar Rotschield, Liat Peterfreund
SQL/PGQ is a new standard that integrates graph querying into relational systems, allowing users to freely switch between graph patterns and SQL. Our experiments show performance g…