Back to papers
I/O Efficient Label-Constrained Reachability Queries in Large Graphs
Summary: Targets label-constrained reachability on graphs larger than RAM, formulating the first I/O-aware reduction-based indexing approach. Two graph-reduction operators yield an adaptively built LCR-Index that answers queries by sequential index scans, minimizing I/O and scaling to billion-edge graphs.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13483
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.3341665e-05
- Overall Rank
- 9,483 | 34.03%
- DOI
-
10.14778/3675034.3675049
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 108 |
Truss Decomposition in Massive Networks |
2012 |
VLDB |
0.00048300163 |
| 279 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029113513 |
| 331 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027214222 |
| 589 |
Massive Graph Triangulation |
2013 |
SIGMOD |
0.00019576567 |
| 686 |
Finding Maximal Cliques in Massive Networks by H*-graph |
2010 |
SIGMOD |
0.00018178029 |
| 690 |
An Analytical Study of Large SPARQL Query Logs |
2018 |
VLDB |
0.00018099792 |
| 1,553 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011402871 |
| 1,880 |
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph |
2013 |
SIGMOD |
0.00010226347 |
| 2,826 |
Regular Path Query Evaluation on Streaming Graphs |
2020 |
SIGMOD |
8.056119e-05 |
| 2,910 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
7.9266529e-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,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1506256e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 6,873 |
Towards Maximum Independent Sets on Massive Graphs |
2015 |
VLDB |
4.8989748e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-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 |
| 9,626 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
4.314762e-05 |
| 12,041 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.1945683e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 3,671 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8560247e-05 |
| 7,596 |
DAG Reduction: Fast Answering Reachability Queries |
2017 |
SIGMOD |
4.7016964e-05 |
| 4,067 |
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach |
2012 |
SIGMOD |
6.4795399e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1506256e-05 |
| 1,777 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.00010589591 |
| 2,957 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8198686e-05 |
| 3,213 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3669794e-05 |
| 788 |
Efficiently Answering Reachability Queries on Very Large Directed Graphs |
2008 |
SIGMOD |
0.00016650034 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |