I/O Efficient Label-Constrained Reachability Queries in Large Graphs
Summary: Addresses external-memory label-constrained reachability, where prior in-memory methods incur prohibitive I/O on massive graphs. Two semantics-preserving graph reductions yield an adaptive LCR-Index, enabling sequential-scan queries and scaling to billion-edge graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Long Yuan (Nanjing University)
- 2. Xia Li (University of New South Wales)
- 3. Zi Chen (Nanjing University)
- 4. Xuemin Lin (Shanghai Jiao Tong University)
- 5. Xiang Zhao (National University of Defense Technology)
- 6. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@article{yuan_vldb24,
title = {{I/O Efficient Label-Constrained Reachability Queries in Large Graphs}},
author = {Yuan, Long and Li, Xia and Chen, Zi and Lin, Xuemin and Zhao, Xiang and Zhang, Wenjie},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {10},
pages = {2590--2602},
doi = {10.14778/3675034.3675049},
url = {https://doi.org/10.14778/3675034.3675049},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,731 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 5.3766157e-05 |
| 10,373 | Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single Machine | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB |
| 2 | 7,707 | DAG Reduction: Fast Answering Reachability Queries | 2017 | SIGMOD |
| 3 | 3,857 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD |
| 4 | 3,979 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB |
| 5 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 6 | 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 7 | 2,700 | Landmark Indexing for Evaluation of Label-Constrained Reachability Queries | 2017 | SIGMOD |
| 8 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 9 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 10 | 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |