Back to papers
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond
Summary: Label-constrained reachability (LCR) on directed edge-labeled graphs tackled with a 2-hop index plus pruning and ordering techniques. Worst-case latency bounded by in-out index size; microsecond responses on billion-scale graphs on a single machine, with up to 5 orders of magnitude speedup over state-of-the-art.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12276
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 4.9242446e-05
- Overall Rank
- 6,795 | 52.73%
- DOI
-
10.14778/3380750.3380753
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,743 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9586508e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 8,668 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.4718257e-05 |
| 9,483 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
4.3341665e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,584 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1945683e-05 |
| 10,985 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,014 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1945683e-05 |
| 11,038 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,385 |
Answering Regular Path Queries through Exemplars |
2022 |
VLDB |
4.1945683e-05 |
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030040036 |
| 279 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029113513 |
| 733 |
GRAIL: Scalable Reachability Index for Large Graphs |
2010 |
VLDB |
0.00017460741 |
| 999 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
0.00014726563 |
| 1,037 |
Querying Graph Databases |
2013 |
PODS |
0.00014502493 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 1,553 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011402871 |
| 1,654 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.000109978 |
| 1,844 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
0.00010341077 |
| 1,880 |
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph |
2013 |
SIGMOD |
0.00010226347 |
| 2,286 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0982591e-05 |
| 2,909 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9305767e-05 |
| 2,957 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8198686e-05 |
| 3,127 |
SCARAB: Scaling Reachability Computation on Large Graphs |
2012 |
SIGMOD |
7.5046522e-05 |
| 3,213 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3669794e-05 |
| 3,671 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8560247e-05 |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3735885e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1506256e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 4,745 |
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs |
2016 |
SIGMOD |
5.9573154e-05 |
| 4,973 |
Constrained Shortest Path Query in a Large Time-Dependent Graph |
2019 |
VLDB |
5.7909705e-05 |
| 6,978 |
C-Explorer: Browsing Communities in Large Graphs |
2017 |
VLDB |
4.8752317e-05 |
| 7,897 |
Correlation Constraint Shortest Path over Large Multi-Relation Graphs |
2019 |
VLDB |
4.6230399e-05 |
Semantically Similar Papers