Computing Label-Constraint Reachability in Graph Databases
Summary: Tree-based index framework for edge-labeled graphs enabling label-constraint reachability. Uses directed maximal weighted spanning tree and sampling to compress generalized transitive closure; experiments on real and synthetic data show efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ruoming Jin (Kent State University)
- 2. Hui Hong (Kent State University)
- 3. Haixun Wang (Microsoft)
- 4. Ning Ruan (Kent State University)
- 5. Yang Xiang (Kent State University)
BibTeX Citation
@inproceedings{jin_sigmod10,
title = {{Computing Label-Constraint Reachability in Graph Databases}},
author = {Jin, Ruoming and Hong, Hui and Wang, Haixun and Ruan, Ning and Xiang, Yang},
series = {{SIGMOD} '10},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1807167.1807183},
url = {https://dl.acm.org/doi/10.1145/1807167.1807183},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 269 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00022786599 |
| 282 | Efficient Management of Transitive Relationships in Large Data and Knowledge Bases | 1989 | SIGMOD | 0.0002242162 |
| 348 | Regular Path Queries with Constraints | 1997 | PODS | 0.00020518814 |
| 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD | 0.00014402233 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,232 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD |
| 2 | 3,278 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB |
| 3 | 1,533 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD |
| 4 | 3,979 | Reachability Querying: An Independent Permutation Labeling Approach | 2014 | VLDB |
| 5 | 2,700 | Landmark Indexing for Evaluation of Label-Constrained Reachability Queries | 2017 | SIGMOD |
| 6 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 7 | 6,603 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 8 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 9 | 7,322 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 10 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |