Back to papers
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice
Summary: Arterial Hierarchy (AH) bridges theory and practice for road-network distance and shortest-path queries. It yields O~(log alpha) distance queries and O~(k+log alpha) shortest-path queries with moderate preprocessing, validated on networks up to 20M nodes.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 4686
- Venue
- SIGMOD
- Year
- 2013
- Pagerank
- 0.00010904736
- Overall Rank
- 1,690 | 88.25%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 20 of 20 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 4,430 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
6.1942479e-05 |
| 4,854 |
TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks |
2018 |
VLDB |
5.8743687e-05 |
| 5,250 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.6044961e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 5,932 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
5.2670741e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-05 |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 7,537 |
TAREEG: A MapReduce-Based Web Service for Extracting Spatial Data from OpenStreetMap |
2014 |
SIGMOD |
4.7176029e-05 |
| 9,078 |
Continuously Monitoring Alternative Shortest Paths on Road Networks |
2020 |
VLDB |
4.400728e-05 |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-05 |
| 9,495 |
Fast Network K-function-based Spatial Analysis |
2022 |
VLDB |
4.3341665e-05 |
| 10,515 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,002 |
LION: Fast and High-Resolution Network Kernel Density Visualization |
2024 |
VLDB |
4.1945683e-05 |
| 11,038 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
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 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 1,892 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010185573 |
| 1,230 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00013150837 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-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 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |