Distinct Shortest Walk Enumeration for RPQs
Summary: Proposes an efficient algorithm for |D|×|A| labeled graphs to enumerate all distinct s–t shortest walks that satisfy a regular path query. Preprocessing O(|D|×|A|) with per-output delay O(λ×|A|); handles epsilon-transitions and regex queries at no extra cost, avoiding exponential duplicates. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Claire David (CNRS; Université Gustave Eiffel)
- 2. Nadime Francis (CNRS; Université Gustave Eiffel)
- 3. Victor Marsault (CNRS; Université Gustave Eiffel)
BibTeX Citation
@inproceedings{david_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Distinct Shortest Walk Enumeration for RPQs}},
url = {https://dl.acm.org/doi/10.1145/3651601},
doi = {10.1145/3651601},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {David, Claire and Francis, Nadime and Marsault, Victor},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 312 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021733819 |
| 900 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.00013337186 |
| 5,418 | Representing Paths in Graph Database Pattern Matching | 2023 | VLDB | 6.2255373e-05 |
| 5,425 | GPC: A Pattern Calculus for Property Graphs | 2023 | PODS | 6.223218e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,658 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS |
| 2 | 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD |
| 3 | 3,473 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD |
| 4 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 5 | 9,235 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS |
| 6 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 7 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 8 | 1,658 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 9 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 10 | 11,583 | Answering Regular Path Queries through Exemplars | 2022 | VLDB |