On the Decidability of Query Containment under Constraints
Summary: Decidability of containment for nonrecursive Datalog under inclusion constraints using set operations, restricted quantifiers, regular path expressions, and cardinality (models relational/ER/O-O schemas). Provides decision procedures/complexity: decidable when q omits regexes or when no number restrictions (first decidability for CQs with regex); undecidable if q' may use inequalities. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 58 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD | 0.00064826446 |
| 144 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00041462501 |
| 909 | On the Equivalence of Recursive and Nonrecursive Datalog Programs | 1992 | PODS | 0.00015428222 |
| 1,384 | Managing Semantic Heterogeneity in Databases : A Theoretical Perspective | 1997 | PODS | 0.00012262892 |
| 1,578 | Constraint Checking with Partial Information | 1994 | PODS | 0.00011284233 |
| 1,952 | Deciding Containment for Queries with Complex Objects (Extended Abstract) | 1997 | PODS | 9.9677831e-05 |
| 2,398 | Containment and Minimization of Positive Conjunctive Queries in OODB's (Extended Abstract) | 1992 | PODS | 8.8973978e-05 |
Previous
Page 1 / 1
Next