Database Paper Browser

Back to papers

A Theory of Regular Queries

Summary: Introduces RQ (regular queries), a natural, operation-closed class for graph/relational queries supporting disjunction, conjunction, projection and transitive closure while retaining decidable query-containment. Shows RQ = a Datalog fragment where recursion is restricted to transitive closure, yielding an expressive yet containment-decidable fragment that enables decidable query optimization. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1700
Venue
PODS
Year
2016
Pagerank
4.3636639e-05
Overall Rank
9,280 | 35.45%
DOI
10.1145/2902251.2902305

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,037 Transforming Property Graphs 2024 VLDB 4.4039656e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers