DBScholar

Back to papers

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)

Paper ID
1612
Venue
PODS
Year
2013
Pagerank
6.4127882e-05
Overall Rank
4,981 | 65.83%
DOI
10.1145/2463664.2467795

Incoming Non-self Citations Over Time

Authors

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.

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
312 A Graphical Query Language Supporting Recursion 1987 SIGMOD 0.00021733819
348 Regular Path Queries with Constraints 1997 PODS 0.00020518814
2,490 Computing Label-Constraint Reachability in Graph Databases 2010 SIGMOD 8.5090456e-05
3,452 The Complexity of Evaluating Path Expressions in SPARQL 2012 PODS 7.4007472e-05
4,986 Querying Graph Patterns 2011 PODS 6.4120976e-05
Previous Page 1 / 1 Next

Semantically Similar Papers