Back to papers
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation
Summary: Comprehensive, side-by-side evaluation of spatial-coherence-based and vertex-importance-based shortest-path and distance queries. Real road networks up to 20M vertices; analyzes preprocessing time, space, and query efficiency, revealing trade-offs and guidelines for method selection.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 10489
- Venue
- VLDB
- Year
- 2012
- Pagerank
- 0.00013501079
- Overall Rank
- 1,173 | 91.85%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 24 of 24 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,653 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.0001098717 |
| 1,694 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010870205 |
| 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 |
| 3,171 |
Minimal On-Road Time Route Scheduling on Time-Dependent Graphs |
2017 |
VLDB |
7.4471807e-05 |
| 4,194 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.3640644e-05 |
| 4,429 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
6.1882774e-05 |
| 5,255 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.5991117e-05 |
| 5,266 |
Incrementalizing Graph Algorithms |
2021 |
SIGMOD |
5.5949839e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 6,144 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
5.1865526e-05 |
| 6,203 |
k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation |
2016 |
VLDB |
5.1552752e-05 |
| 6,491 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0368875e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 8,252 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.544713e-05 |
| 8,287 |
QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.5392079e-05 |
| 9,074 |
Continuously Monitoring Alternative Shortest Paths on Road Networks |
2020 |
VLDB |
4.3965098e-05 |
| 9,472 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3300131e-05 |
| 10,592 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,677 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks |
2025 |
VLDB |
4.1905499e-05 |
| 11,498 |
Optimizing Bipartite Matching in Real-World Applications by Incremental Cost Computation |
2021 |
VLDB |
4.1905499e-05 |
| 11,516 |
A Demonstration of QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.1905499e-05 |
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.
Semantically Similar Papers