Dec 9, 2023 � We consider the Distinct Shortest Walks problem. Given two vertices s and t of a graph database \mathcal{D} and a regular path query, enumerate all walks of�...
May 14, 2024 � We propose an efficient algorithm for graph databases with multiple labels. The preprocessing runs in O(DxA) and the delay between two�...
We consider the Distinct Shortest Walks problem. Given two vertices s and t of a graph database D and a regular path query, we want to enumerate all walks�...
May 23, 2024 � We consider the Distinct Shortest Walks problem. Given two vertices s and t of a graph database D and a regular path query,�...
Dec 9, 2023 � This work considers the Distinct Shortest Walks problem and proposes an efficient algorithm for graph databases with multiple labels that�...
Distinct Shortest Walk Enumeration for RPQs. Proceedings of the ACM on Management of Data. 2024-05-10 | Journal article. DOI: 10.1145/3651601. Contributors�...
We consider several versions of this problem, corresponding to different semantics of RPQs that have recently been considered: arbitrary paths, shortest paths,�...
Missing: Distinct Walk
Regular path queries (RPQs) are a central component of graph databases. We investigate decision- and enumeration problems concerning the evaluation of RPQs�...
Missing: Walk | Show results with:Walk
Based on Yen's algorithm for enumerating simple paths in directed and undirected graphs, we show that polynomial time algorithms for RPQ evaluation problems�...
RPQs (regular path queries) are an important building block of most query languages for graph databases. They are gener- ally evaluated under homomorphism�...