Scaling Up Distance Labeling on Graphs with Core-Periphery Properties
Summary: Core-Tree (CT) Index scales exact 2-hop distance labeling to massive graphs by exploiting core–periphery structure; links treewidth, index size, and query time. CT delivers a compact index with sub-0.4 ms queries on graphs as large as 5.5B edges, enabling distance queries previously infeasible. (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_sigmod20,
title = {{Scaling Up Distance Labeling on Graphs with Core-Periphery Properties}},
author = {Li, Wentao and Qiao, Miao and Qin, Lu and Zhang, Ying and Chang, Lijun and Lin, Xuemin},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3389748},
url = {https://dl.acm.org/doi/10.1145/3318464.3389748},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
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 |
|---|---|---|---|---|
| 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 |
| 1,339 | Computing Personalized PageRank Quickly by Exploiting Graph Structures | 2014 | VLDB | 0.00011112799 |
| 1,553 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB | 0.0001037809 |
| 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 0.00010216983 |
| 2,152 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD | 9.0778596e-05 |
Previous
Page 1 / 1
Next