Efficient Regular Simple Path Queries under Transitive Restricted Expressions
Summary: Define transitive restricted expressions (covering >99% of real-world RSPQs) and give an exact framework for reachability and enumeration for them. New reachability tests, candidate pruning, and redundancy elimination achieve near-approximate speeds and up to 100× exact-method speedups. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Qi Liang (Guangdong University of Technology)
- 2. Dian Ouyang (Guangdong University of Technology)
- 3. Fan Zhang (Guangdong University of Technology)
- 4. Jianye Yang (Guangdong University of Technology; Peng Cheng Laboratory)
- 5. Xuemin Lin (Shanghai Jiao Tong University)
- 6. Zhihong Tian (Guangdong University of Technology)
BibTeX Citation
@article{liang_vldb24,
title = {{Efficient Regular Simple Path Queries under Transitive Restricted Expressions}},
author = {Liang, Qi and Ouyang, Dian and Zhang, Fan and Yang, Jianye and Lin, Xuemin and Tian, Zhihong},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {7},
pages = {1710--1722},
doi = {10.14778/3654621.3654636},
url = {https://doi.org/10.14778/3654621.3654636},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 294 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 2 | 3,452 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS |
| 3 | 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD |
| 4 | 747 | Querying Graph Databases | 2013 | PODS |
| 5 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 6 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 7 | 11,583 | Answering Regular Path Queries through Exemplars | 2022 | VLDB |
| 8 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 9 | 3,473 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD |
| 10 | 1,658 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |