Back to papers
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries
Summary: Introduces landmark-based indexes for efficient LCR queries on directed graphs, enabling scalable evaluation of regular-path queries. Reports smaller index size and orders-of-magnitude faster LCR evaluation versus prior work, with open-source C++ code.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5321
- Venue
- SIGMOD
- Year
- 2017
- Pagerank
- 7.3669794e-05
- Overall Rank
- 3,213 | 77.65%
- DOI
-
10.1145/3035918.3035955
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3735885e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 6,730 |
A Hierarchical Contraction Scheme for Querying Big Graphs |
2022 |
SIGMOD |
4.9479867e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 6,985 |
CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression |
2023 |
SIGMOD |
4.8729387e-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 |
| 7,897 |
Correlation Constraint Shortest Path over Large Multi-Relation Graphs |
2019 |
VLDB |
4.6230399e-05 |
| 9,089 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.39898e-05 |
| 9,483 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
4.3341665e-05 |
| 9,556 |
Materialized View Selection & View-Based Query Planning for Regular Path Queries |
2024 |
SIGMOD |
4.3254416e-05 |
| 10,467 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,014 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1945683e-05 |
| 11,385 |
Answering Regular Path Queries through Exemplars |
2022 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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 |
| 733 |
GRAIL: Scalable Reachability Index for Large Graphs |
2010 |
VLDB |
0.00017460741 |
| 1,037 |
Querying Graph Databases |
2013 |
PODS |
0.00014502493 |
| 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,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,671 |
Simple, Fast, and Scalable Reachability Oracle |
2013 |
VLDB |
6.8560247e-05 |
| 4,280 |
Query Planning for Evaluating SPARQL Property Paths |
2016 |
SIGMOD |
6.2948356e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1506256e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 334 |
Fast and Practical Indexing and Querying of Very Large Graphs |
2007 |
SIGMOD |
0.00027081079 |
| 1,838 |
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying |
2013 |
VLDB |
0.00010349881 |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3735885e-05 |
| 1,777 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.00010589591 |
| 8,256 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.5490743e-05 |
| 788 |
Efficiently Answering Reachability Queries on Very Large Directed Graphs |
2008 |
SIGMOD |
0.00016650034 |
| 2,957 |
Computing Label-Constraint Reachability in Graph Databases |
2010 |
SIGMOD |
7.8198686e-05 |
| 6,795 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
4.9242446e-05 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
| 9,483 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
4.3341665e-05 |