Back to papers
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks
Summary: Introduces Border-based State Move (BSM), an index-driven LCSP solver for labeled road graphs using border-vertex skipping to prune exploration. Shows two orders of magnitude speedup vs top LCSP methods and supports flexible language constraints.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7291
- Venue
- SIGMOD
- Year
- 2025
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,525 | 26.86%
- DOI
-
10.1145/3725402
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 1,235 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.0001311113 |
| 1,445 |
Finding Regular Simple Paths in Graph Databases |
1989 |
VLDB |
0.00011937596 |
| 1,653 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.0001098717 |
| 2,192 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3282272e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 2,958 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8126329e-05 |
| 3,221 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3541078e-05 |
| 3,346 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.1903469e-05 |
| 4,194 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.3640644e-05 |
| 4,739 |
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs |
2016 |
SIGMOD |
5.9515822e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,255 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.5991117e-05 |
| 6,796 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9195203e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3006524e-05 |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |
| 1,694 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010870205 |
| 1,173 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013501079 |
| 2,192 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3282272e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 2,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 1,235 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.0001311113 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3006524e-05 |