Back to papers
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks
Summary: G2H: CPU–GPU hybrid hop-labeling using hybrid partitioning, node reordering, and label-pruning to parallelize and balance label construction. Builds in seconds (urban) or <1 min for 6M vertices; handles hundreds of millions qps—several× faster build and ~100× query throughput vs prior art.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 14236
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 5.1725247e-05
- Overall Rank
- 10,878 | 24.40%
- DOI
-
10.14778/3712221.3712241
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 3 |
Pregel: A System for Large-Scale Graph Processing |
2010 |
SIGMOD |
0.0012294368 |
| 21 |
Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud |
2012 |
VLDB |
0.00057138114 |
| 199 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00025845502 |
| 365 |
TEDI: Efficient Shortest Path Query Answering on Graphs |
2010 |
SIGMOD |
0.00020126807 |
| 1,293 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.00011358008 |
| 1,681 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010108085 |
| 2,059 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
9.3142927e-05 |
| 2,110 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
9.2155507e-05 |
| 2,826 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
8.1351358e-05 |
| 3,811 |
Effective Caching of Shortest Paths for Location-Based Services |
2012 |
SIGMOD |
7.1598483e-05 |
| 4,338 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
6.8270435e-05 |
| 5,250 |
Parallel Personalized PageRank on Dynamic Graphs |
2018 |
VLDB |
6.3685554e-05 |
| 5,531 |
Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints |
2021 |
SIGMOD |
6.2449663e-05 |
| 5,952 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0909845e-05 |
| 6,200 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
6.0169401e-05 |
| 6,732 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.845774e-05 |
| 7,056 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
5.7678969e-05 |
| 7,104 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.754502e-05 |
| 7,435 |
Accelerating Exact Constrained Shortest Paths on GPUs |
2021 |
VLDB |
5.6805131e-05 |
| 8,877 |
Planting Trees for scalable and efficient Canonical Hub Labeling |
2020 |
VLDB |
5.4171641e-05 |
| 8,984 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
5.4025283e-05 |
| 9,224 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
5.3616561e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,171 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,524 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
5.1725247e-05 |
| 1,225 |
A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs |
2012 |
SIGMOD |
0.00011680335 |
| 1,252 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00011557184 |
| 11,041 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
5.1725247e-05 |
| 7,104 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
5.754502e-05 |
| 6,200 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
6.0169401e-05 |
| 2,826 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
8.1351358e-05 |
| 9,466 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
5.3246578e-05 |
| 1,681 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
0.00010108085 |