1 citations · 2 across the 4 of their papers we have counts for
5 papers
Time to Move on: Querying without Nulls and Bags
Molham Aref, Leonid Libkin, Wim Martens
SQL is the database community's success story in terms of language design. The key reason for its success is its declarativeness: it gives rise to optimizability, reducing the prog…
A Compositional Language for Property Graphs
Marcelo Arenas, Leonid Libkin, Wim Martens
A major shortcoming of the recently standardized graph query languages GQL and SQL/PGQ is their lack of compositionality. Given the importance of these languages in querying knowle…
A Unifying Perspective on Succinct Data Representations
Benny Kimelfeld, Wim Martens, Matthias Niewerth
Factorized representations (FRs) are a well-known tool to succinctly represent results of join queries and have been originally defined using the named database perspective. We def…
PathFinder: A unified approach for handling paths in graph query languages
Benjamín Farías, Wim Martens, Carlos Rojas +1
Path queries are a core feature of modern graph query languages such as Cypher, SQL/PGQ, and GQL. These languages provide a rich set of features for matching paths, such as restric…
Representing Paths in Graph Database Pattern Matching
Wim Martens, Matthias Niewerth, Tina Popp +2
Modern graph database query languages such as GQL, SQL/PGQ, and their academic predecessor G-Core promote paths to first-class citizens in the sense that paths that match regular p…