Back to papers
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
Summary: Introduces Kleene Language Constrained Shortest Paths for dynamic, label-based edge restrictions in road-network queries. Extends Contraction Hierarchies to support these constraints, delivering over 3 orders of magnitude speedups on a 50M-edge North American road network vs naive Dijkstra and over 2 orders of magnitude vs prior indexing.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 10296
- Venue
- VLDB
- Year
- 2011
- Pagerank
- 0.00013150837
- Overall Rank
- 1,230 | 91.45%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,054 |
On k-skip Shortest Paths |
2011 |
SIGMOD |
0.00014422699 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 4,745 |
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs |
2016 |
SIGMOD |
5.9573154e-05 |
| 6,743 |
Utility-Aware Ridesharing on Road Networks |
2017 |
SIGMOD |
4.9430196e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 7,897 |
Correlation Constraint Shortest Path over Large Multi-Relation Graphs |
2019 |
VLDB |
4.6230399e-05 |
| 9,495 |
Fast Network K-function-based Spatial Analysis |
2022 |
VLDB |
4.3341665e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,002 |
LION: Fast and High-Resolution Network Kernel Density Visualization |
2024 |
VLDB |
4.1945683e-05 |
| 11,064 |
Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.1945683e-05 |
| 11,928 |
CANDS: Continuous Optimal Navigation via Distributed Stream Processing |
2015 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 11,199 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1945683e-05 |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-05 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |