An Experimental Study on Hub Labeling based Shortest Path Algorithms
Summary: Comprehensive study of hub-labeling shortest-path indexes, benchmarking state-of-the-art methods against alternatives for efficiency and applicability. Introduces Significant-path-based Hub Pushing (SHP), reducing index construction time while retaining fast queries. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ye Li (University of Macau)
- 2. Leong Hou U (University of Macau)
- 3. Man Lung Yiu (Hong Kong Polytechnic University)
- 4. Ngai Meng Kou (University of Macau)
BibTeX Citation
@article{li_vldb18,
title = {{An Experimental Study on Hub Labeling based Shortest Path Algorithms}},
author = {Li, Ye and U, Leong Hou and Yiu, Man Lung and Kou, Ngai Meng},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {4},
pages = {445--457},
doi = {10.1145/3164135.3164141},
url = {https://doi.org/10.1145/3164135.3164141},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 26 of 26 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 192 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025740385 |
| 376 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019655871 |
| 954 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00012856563 |
| 1,233 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00011397529 |
| 1,250 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD | 0.00011325987 |
| 1,577 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB | 0.00010155939 |
| 1,653 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 9.9588776e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,899 | Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks | 2023 | SIGMOD |
| 2 | 9,200 | Planting Trees for scalable and efficient Canonical Hub Labeling | 2020 | VLDB |
| 3 | 1,577 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB |
| 4 | 1,581 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD |
| 5 | 7,399 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 6 | 1,250 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD |
| 7 | 8,695 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD |
| 8 | 5,409 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB |
| 9 | 11,634 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 10 | 5,699 | Hub Labeling for Shortest Path Counting | 2020 | SIGMOD |