Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks
Summary: Hierarchical cut 2-hop labelling (HC2L) merges hub/highway and tree-decomposition ideas via a balanced tree hierarchy to shrink distance labels and prune query search space. HC2Lp parallelizes preprocessing; on 10 real road networks it delivers 1.5–4x faster queries and up to 60% smaller labels, with comparable build times. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Muhammad Farhan (Australian National University)
- 2. Henning Koehler (Massey University)
- 3. Robert Ohms (Australian National University)
- 4. Qing Wang (Australian National University)
BibTeX Citation
@inproceedings{farhan_sigmod23,
title = {{Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks}},
author = {Farhan, Muhammad and Koehler, Henning and Ohms, Robert and Wang, Qing},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3626731},
url = {https://dl.acm.org/doi/10.1145/3626731},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,799 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD | 5.1257999e-05 |
| 10,255 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 5.050482e-05 |
| 10,564 | Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach | 2026 | SIGMOD | 4.9793485e-05 |
| 10,647 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD | 4.9793485e-05 |
| 11,204 | Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks | 2025 | SIGMOD | 4.9793485e-05 |
| 11,251 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB | 4.9793485e-05 |
| 11,311 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB | 4.9793485e-05 |
| 11,449 | A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 197 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025584127 |
| 1,232 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.0001141008 |
| 1,252 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD | 0.00011336944 |
| 1,645 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 9.9953879e-05 |
| 2,943 | P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators | 2021 | SIGMOD | 7.8314485e-05 |
| 3,687 | Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks | 2022 | SIGMOD | 7.0955331e-05 |
Previous
Page 1 / 1
Next