8 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.DB2022★ 1 cited
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…
cs.FL2019★ 8 cited
A Trichotomy for Regular Trail Queries
Wim Martens, Matthias Niewerth, Tina Popp
Regular path queries (RPQs) are an essential component of graph query languages. Such queries consider a regular expression r and a directed edge-labeled graph G and search for pat…