Scaling Distance Labeling on Small-World Networks
Summary: Proposes PSL to scale distance labeling on small-world graphs, turning PLL's node-order pruning into propagation shortest-distance dependencies. Gives D-round labeling (D) with near-linear multi-core speedups on billion-scale graphs and smaller indices. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wentao Li (University of Technology Sydney)
- 2. Miao Qiao (University of Auckland)
- 3. Lu Qin (University of Technology Sydney)
- 4. Ying Zhang (University of Technology Sydney)
- 5. Lijun Chang (University of Sydney)
- 6. Xuemin Lin (University of New South Wales)
BibTeX Citation
@inproceedings{li_sigmod19,
title = {{Scaling Distance Labeling on Small-World Networks}},
author = {Li, Wentao and Qiao, Miao and Qin, Lu and Zhang, Ying and Chang, Lijun and Lin, Xuemin},
series = {{SIGMOD} '19},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3299869.3319877},
url = {https://dl.acm.org/doi/10.1145/3299869.3319877},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 23 of 23 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,346 | An Experimental Study on Hub Labeling based Shortest Path Algorithms | 2018 | VLDB | 0.00010949128 |
| 1,577 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB | 0.00010155939 |
| 1,581 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010151896 |
| 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,409 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB |
| 2 | 5,893 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD |
| 3 | 6,192 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 4 | 1,653 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB |
| 5 | 11,315 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB |
| 6 | 1,577 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB |
| 7 | 4,214 | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties | 2020 | SIGMOD |
| 8 | 11,634 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 9 | 9,200 | Planting Trees for scalable and efficient Canonical Hub Labeling | 2020 | VLDB |
| 10 | 192 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD |