Does Query Evaluation Tractability Help Query Containment?
Summary: Restricting target UCQs/UC2RPQs to tractable classes alone does not lower Datalog⊆UCQ/UC2RPQ containment from 2EXPTIME. However, acyclicity plus bounds on shared variables (UCQs) or connecting edges (UC2RPQs) yields EXPTIME decidability, and these bounds are tight. (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. Pablo Barceló
- 2. Miguel Romero
- 3. Moshe Y. Vardi
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,058 | Efficient Evaluation and Approximation of Well-designed Pattern Trees | 2015 | PODS | 6.4866036e-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 |
|---|---|---|---|---|
| 114 | A Query Language and Optimization Techniques for Unstructured Data | 1996 | SIGMOD | 0.00046339735 |
| 537 | Parallel Evaluation of Recursive Rule Queries | 1986 | PODS | 0.0002068591 |
| 1,037 | Querying Graph Databases | 2013 | PODS | 0.00014502493 |
| 3,413 | On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs | 1994 | PODS | 7.1240395e-05 |
| 6,948 | Semantic Acyclicity on Graph Databases | 2013 | PODS | 4.8898337e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,556 | The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 2020 | PODS | 4.1945683e-05 |
| 7,070 | On the Decidability of Containment of Recursive Datalog Queries - Preliminary report | 2004 | PODS | 4.843579e-05 |
| 9,280 | A Theory of Regular Queries | 2016 | PODS | 4.3636639e-05 |
| 407 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024004562 |
| 6,896 | Containment of Graph Queries Modulo Schema | 2024 | PODS | 4.8925595e-05 |
| 7,598 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.7004867e-05 |
| 4,048 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS | 6.4968603e-05 |
| 6,948 | Semantic Acyclicity on Graph Databases | 2013 | PODS | 4.8898337e-05 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 1,490 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011699154 |