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
- 2. Nadime Francis
- 3. Victor Marsault
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 |
|---|---|---|---|---|
| 363 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025715157 |
| 964 | G-CORE: A Core for Future Graph Query Languages | 2018 | SIGMOD | 0.0001497475 |
| 5,517 | Representing Paths in Graph Database Pattern Matching | 2023 | VLDB | 5.4626107e-05 |
| 5,651 | GPC: A Pattern Calculus for Property Graphs | 2023 | PODS | 5.3905536e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4411907e-05 |
| 2,826 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.056119e-05 |
| 4,191 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 6.3735885e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010467069 |
| 9,744 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2897489e-05 |
| 4,946 | Querying Graph Patterns | 2011 | PODS | 5.8149362e-05 |
| 5,424 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5126983e-05 |
| 1,444 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011946075 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
| 11,385 | Answering Regular Path Queries through Exemplars | 2022 | VLDB | 4.1945683e-05 |