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)

Paper ID: 11944
Venue: VLDB
Year: 2018
Pagerank: 0.00011210911
Overall Rank: 1,309 | 91.03%
DOI: 10.1145/3164135.3164141

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.

Rank	Citing Paper	Year	Venue	Pagerank
2,097	Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees	2020	VLDB	9.1725037e-05
2,152	Scaling Distance Labeling on Small-World Networks	2019	SIGMOD	9.0778596e-05
2,871	P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators	2021	SIGMOD	8.0110616e-05
3,612	Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks	2022	SIGMOD	7.2579119e-05
5,044	Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs	2021	VLDB	6.3883109e-05
5,571	Hub Labeling for Shortest Path Counting	2020	SIGMOD	6.1686653e-05
5,678	Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement	2022	VLDB	6.1246854e-05
6,603	Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond	2020	VLDB	5.824568e-05
6,844	An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network	2021	VLDB	5.7566172e-05
7,084	The Simpler The Better: An Indexing Approach for Shared-Route Planning Queries	2020	VLDB	5.7074102e-05
7,158	BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale	2022	SIGMOD	5.6858492e-05
7,226	Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach	2022	VLDB	5.6667372e-05
9,003	Planting Trees for scalable and efficient Canonical Hub Labeling	2020	VLDB	5.3345443e-05
9,229	Continuously Monitoring Alternative Shortest Paths on Road Networks	2020	VLDB	5.3017894e-05
9,632	Fast Network K-function-based Spatial Analysis	2022	VLDB	5.2434488e-05
9,815	PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks	2024	VLDB	5.214913e-05
10,789	Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks	2025	SIGMOD	5.093636e-05
10,845	Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs	2025	VLDB	5.093636e-05
11,097	A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks	2025	VLDB	5.093636e-05
11,213	LION: Fast and High-Resolution Network Kernel Density Visualization	2024	VLDB	5.093636e-05
11,248	Distributed Shortest Distance Labeling on Large-Scale Graphs	2024	VLDB	5.093636e-05
11,439	TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks	2023	VLDB	5.093636e-05
11,463	Approximating Probabilistic Group Steiner Trees in Graphs	2023	VLDB	5.093636e-05
11,574	Succinct Graph Representations as Distance Oracles: An Experimental Evaluation	2022	VLDB	5.093636e-05
11,697	Fast Augmentation Algorithms for Network Kernel Density Visualization	2021	VLDB	5.093636e-05
11,729	SpeakNav: Voice-based Route Description Language Understanding for Template-driven Path Search	2021	VLDB	5.093636e-05

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
195	Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling	2013	SIGMOD	0.00025813775
370	TEDI: Efficient Shortest Path Query Answering on Graphs	2010	SIGMOD	0.00019937972
949	Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation	2012	VLDB	0.00013028107
1,205	Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice	2013	SIGMOD	0.00011664469
1,232	A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs	2012	SIGMOD	0.00011566372
1,553	Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks	2014	VLDB	0.0001037809
1,622	IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying	2013	VLDB	0.00010201102

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,292	Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks	2023	SIGMOD
2	9,003	Planting Trees for scalable and efficient Canonical Hub Labeling	2020	VLDB
3	1,553	Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks	2014	VLDB
4	1,613	When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks	2018	SIGMOD
5	7,226	Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach	2022	VLDB
6	1,232	A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs	2012	SIGMOD
7	9,619	Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks	2025	SIGMOD
8	5,678	Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement	2022	VLDB
9	11,248	Distributed Shortest Distance Labeling on Large-Scale Graphs	2024	VLDB
10	5,571	Hub Labeling for Shortest Path Counting	2020	SIGMOD