A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs
Summary: Highway-Centric Labeling for shortest-path queries in large sparse graphs, with highway-structure and bipartite cover. Outperforms 2-hop in index size and query time, with exact distances and bounded-accuracy approximations; validated on synthetic/real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ruoming Jin (Kent State University)
- 2. Ning Ruan (Kent State University)
- 3. Yang Xiang (Ohio State University)
- 4. Victor E. Lee (Kent State University)
BibTeX Citation
@inproceedings{jin_sigmod12,
title = {{A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs}},
author = {Jin, Ruoming and Ruan, Ning and Xiang, Yang and Lee, Victor E.},
series = {{SIGMOD} '12},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2213836.2213887},
url = {https://dl.acm.org/doi/10.1145/2213836.2213887},
year = {2012}
}
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 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 |
|---|---|---|---|---|
| 269 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022786599 |
| 301 | Proximity Search in Databases | 1998 | VLDB | 0.00022032878 |
| 370 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019937972 |
| 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00018532516 |
| 968 | Path Oracles for Spatial Networks | 2009 | VLDB | 0.00012901559 |
| 1,386 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00010950754 |
Previous
Page 1 / 1
Next