Back to papers
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators
Summary: P2H uses projected vertex separators to shrink 2-hop distance labels on road networks. Optimized separator selection and index maintenance for dynamic weights yield smaller indexes and ~2× faster queries on large datasets.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6270
- Venue
- SIGMOD
- Year
- 2021
- Pagerank
- 7.197276e-05
- Overall Rank
- 3,342 | 76.76%
- DOI
-
10.1145/3448016.3459245
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-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,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,065 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
4.1945683e-05 |
| 11,199 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1945683e-05 |
| 11,239 |
TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks |
2023 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 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 |
| 10,515 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 1,378 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00012294512 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 10,874 |
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks |
2025 |
VLDB |
4.1945683e-05 |
| 9,470 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3341665e-05 |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |