Back to papers
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees
Summary: Dynamic maintenance of Contraction Hierarchies (CH) for road networks; a shortcut-centric paradigm targets a small set of updates. SS-Graph and shortcut weight propagation enable streaming and batch updates with theoretical guarantees, delivering 2–3 orders of magnitude speedup over prior work.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12260
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 8.5683079e-05
- Overall Rank
- 2,547 | 82.29%
- DOI
-
10.14778/3377369.3377371
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 3,342 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.197276e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-05 |
| 7,441 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
4.7302202e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 7,675 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.6817479e-05 |
| 8,294 |
QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.5435639e-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,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,515 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,600 |
Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints |
2025 |
VLDB |
4.1945683e-05 |
| 10,669 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks |
2025 |
VLDB |
4.1945683e-05 |
| 10,874 |
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks |
2025 |
VLDB |
4.1945683e-05 |
| 11,038 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,253 |
Automatic Road Extraction with Multi-Source Data Revisited: Completeness, Smoothness and Discrimination |
2023 |
VLDB |
4.1945683e-05 |
| 11,512 |
A Demonstration of QARTA: An ML-based System for Accurate Map Services |
2021 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 1,378 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012294512 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 1,892 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010185573 |
| 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 |
| 5,751 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
5.3409543e-05 |
| 6,428 |
An Experimental Evaluation of Point-of-interest Recommendation in Location-based Social Networks |
2017 |
VLDB |
5.0668968e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,078 |
Continuously Monitoring Alternative Shortest Paths on Road Networks |
2020 |
VLDB |
4.400728e-05 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-05 |
| 1,892 |
Querying Shortest Paths on Time Dependent Road Networks |
2019 |
VLDB |
0.00010185573 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 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 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 1,230 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00013150837 |