Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond
Summary: Novel label-constrained 2-hop indexes use pruning and vertex-ordering strategies to avoid exponential label-set enumeration and bound query time by index-entry size. Delivers microsecond LCR queries on billion-edge graphs, with up to 10^5× speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. You Peng (University of New South Wales)
- 2. Ying Zhang (University of Technology Sydney)
- 3. Xuemin Lin (University of New South Wales)
- 4. Lu Qin (University of Technology Sydney)
- 5. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@article{peng_vldb20,
title = {{Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond}},
author = {Peng, You and Zhang, Ying and Lin, Xuemin and Qin, Lu and Zhang, Wenjie},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {6},
pages = {812--825},
doi = {10.14778/3380750.3380753},
url = {https://doi.org/10.14778/3380750.3380753},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 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 | 1,585 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB |
| 2 | 1,849 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 3 | 4,488 | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties | 2020 | SIGMOD |
| 4 | 5,000 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 5 | 4,049 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB |
| 6 | 774 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 7 | 2,734 | Landmark Indexing for Evaluation of Label-Constrained Reachability Queries | 2017 | SIGMOD |
| 8 | 2,534 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 9 | 6,765 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 10 | 9,805 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |