A Trichotomy for Regular Simple Path Queries on Graphs
Summary: Complete classification of regular languages for regular simple path queries: data complexity is exactly AC0, NL-complete, or NP-complete. Identifies a simple regex fragment for tractability; membership testing is NL-complete for DFAs and PSPACE-complete for NFAs/regexes, with results extended to vertex-labeled graphs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Guillaume Bagan (INRIA)
- 2. Angela Bonifati (INRIA; University of Lille 1)
- 3. Benoit Groz (Tel Aviv University)
BibTeX Citation
@inproceedings{bagan_pods13,
address = {New York, NY, USA},
series = {{PODS} '13},
title = {{A Trichotomy for Regular Simple Path Queries on Graphs}},
url = {https://dl.acm.org/doi/10.1145/2463664.2467795},
doi = {10.1145/2463664.2467795},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Bagan, Guillaume and Bonifati, Angela and Groz, Benoit},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 540 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.0001671863 |
| 2,258 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.7393197e-05 |
| 3,523 | Efficiently Answering Regular Simple Path Queries on Large Labeled Networks | 2019 | SIGMOD | 7.2309001e-05 |
| 5,559 | Representing Paths in Graph Database Pattern Matching | 2023 | VLDB | 6.082972e-05 |
| 7,818 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 5.4461633e-05 |
| 9,185 | Towards Theory for Real-World Data | 2022 | PODS | 5.2102846e-05 |
| 11,567 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.9769913e-05 |
| 11,615 | Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous Graphs | 2024 | VLDB | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 305 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00021580917 |
| 356 | Regular Path Queries with Constraints | 1997 | PODS | 0.0002009439 |
| 2,535 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD | 8.3296282e-05 |
| 3,474 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS | 7.2684123e-05 |
| 5,099 | Querying Graph Patterns | 2011 | PODS | 6.2713809e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,487 | Distinct Shortest Walk Enumeration for RPQs | 2024 | PODS |
| 2 | 3,474 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS |
| 3 | 11,100 | Resilience for Regular Path Queries: Towards a Complexity Classification | 2025 | PODS |
| 4 | 9,420 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS |
| 5 | 12,397 | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | 2015 | PODS |
| 6 | 5,099 | Querying Graph Patterns | 2011 | PODS |
| 7 | 1,468 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 8 | 11,567 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 9 | 1,597 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 10 | 7,818 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS |