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
- 12277
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 4.9195203e-05
- Overall Rank
- 6,796 | 52.77%
- 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,737 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9529218e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 7,430 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7275494e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 8,666 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.467539e-05 |
| 9,485 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
4.3300131e-05 |
| 10,525 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,592 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,988 |
Constant-time Connectivity Querying in Dynamic Graphs |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,017 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1905499e-05 |
| 11,041 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,387 |
Answering Regular Path Queries through Exemplars |
2022 |
VLDB |
4.1905499e-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.00030020929 |
| 280 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029092277 |
| 727 |
GRAIL: Scalable Reachability Index for Large Graphs |
2010 |
VLDB |
0.00017462279 |
| 1,000 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
0.00014714977 |
| 1,040 |
Querying Graph Databases |
2013 |
PODS |
0.00014483577 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 1,551 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011395294 |
| 1,653 |
An Experimental Study on Hub Labeling based Shortest Path Algorithms |
2018 |
VLDB |
0.0001098717 |
| 1,848 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
0.00010331574 |
| 1,879 |
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph |
2013 |
SIGMOD |
0.00010227906 |
| 2,291 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0894835e-05 |
| 2,913 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
7.9229304e-05 |
| 2,958 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8126329e-05 |
| 3,130 |
SCARAB: Scaling Reachability Computation on Large Graphs |
2012 |
SIGMOD |
7.5054361e-05 |
| 3,221 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3541078e-05 |
| 3,676 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8500097e-05 |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3676619e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1452192e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 4,739 |
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs |
2016 |
SIGMOD |
5.9515822e-05 |
| 4,976 |
Constrained Shortest Path Query in a Large Time-Dependent Graph |
2019 |
VLDB |
5.7854051e-05 |
| 6,977 |
C-Explorer: Browsing Communities in Large Graphs |
2017 |
VLDB |
4.8705543e-05 |
| 7,897 |
Correlation Constraint Shortest Path over Large Multi-Relation Graphs |
2019 |
VLDB |
4.6186066e-05 |
Semantically Similar Papers