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)
Incoming Non-self Citations Over Time
Authors
- 1. Lucien D.J. Valstar (Eindhoven University of Technology)
- 2. George H.L. Fletcher (Eindhoven University of Technology)
- 3. Yuichi Yoshida (National Institute of Informatics; Preferred Infrastructure, Inc)
BibTeX Citation
@inproceedings{valstar_sigmod17,
title = {{Landmark Indexing for Evaluation of Label-Constrained Reachability Queries}},
author = {Valstar, Lucien D.J. and Fletcher, George H.L. and Yoshida, Yuichi},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3035955},
url = {https://dl.acm.org/doi/10.1145/3035918.3035955},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 679 | GRAIL: Scalable Reachability Index for Large Graphs | 2010 | VLDB | 0.00015055389 |
| 747 | Querying Graph Databases | 2013 | PODS | 0.00014400452 |
| 1,301 | A Memory Efficient Reachability Data Structure Through Bit Vector Compression | 2011 | SIGMOD | 0.00011255351 |
| 1,533 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010467148 |
| 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 8.5090456e-05 |
| 3,021 | SCARAB: Scaling Reachability Computation on Large Graphs | 2012 | SIGMOD | 7.8401031e-05 |
| 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB | 7.5712342e-05 |
| 3,649 | Query Planning for Evaluating SPARQL Property Paths | 2016 | SIGMOD | 7.2251335e-05 |
| 3,979 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB | 6.9754185e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 322 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD |
| 2 | 1,622 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB |
| 3 | 3,473 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD |
| 4 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 5 | 5,678 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB |
| 6 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 7 | 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 8 | 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 9 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 10 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |