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
- 13484
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.3300131e-05
- Overall Rank
- 9,485 | 34.08%
- 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 |
| 106 |
Truss Decomposition in Massive Networks |
2012 |
VLDB |
0.00048373761 |
| 280 |
3-HOP: A High-Compression Indexing Scheme for Reachability Query |
2009 |
SIGMOD |
0.00029092277 |
| 327 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027312381 |
| 588 |
Massive Graph Triangulation |
2013 |
SIGMOD |
0.00019588834 |
| 657 |
An Analytical Study of Large SPARQL Query Logs |
2018 |
VLDB |
0.00018581389 |
| 682 |
Finding Maximal Cliques in Massive Networks by H*-graph |
2010 |
SIGMOD |
0.0001816451 |
| 1,551 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011395294 |
| 1,879 |
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph |
2013 |
SIGMOD |
0.00010227906 |
| 2,799 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
8.109137e-05 |
| 2,832 |
Regular Path Query Evaluation on Streaming Graphs |
2020 |
SIGMOD |
8.048358e-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,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1452192e-05 |
| 6,796 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9195203e-05 |
| 6,877 |
Towards Maximum Independent Sets on Massive Graphs |
2015 |
VLDB |
4.8945769e-05 |
| 7,343 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7511136e-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 |
| 9,626 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
4.3106273e-05 |
| 12,049 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.1905499e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 3,676 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8500097e-05 |
| 7,595 |
DAG Reduction: Fast Answering Reachability Queries |
2017 |
SIGMOD |
4.6980168e-05 |
| 4,070 |
Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach |
2012 |
SIGMOD |
6.4739921e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1452192e-05 |
| 1,776 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.0001058029 |
| 2,958 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8126329e-05 |
| 3,221 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3541078e-05 |
| 784 |
Efficiently Answering Reachability Queries on Very Large Directed Graphs |
2008 |
SIGMOD |
0.00016648392 |
| 7,430 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7275494e-05 |
| 6,796 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9195203e-05 |