On conjunctive queries containing inequalities
Journal of the ACM (JACM)
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Equivalence of datalog queries is undecidable
Journal of Logic Programming
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of equivalence between recursive and nonrecursive Datalog programs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive query containment with respect to views and constraints
Information Processing Letters
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Query containment for data integration systems
Journal of Computer and System Sciences - Special issue on PODS 2000
On the containment of conjunctive queries
Computer Science in Perspective
On the decidability of containment of recursive datalog queries - preliminary report
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Decidable containment of recursive queries
Theoretical Computer Science - Database theory
The containment problem for Real conjunctive queries with inequalities
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding equivalences among conjunctive aggregate queries
Journal of the ACM (JACM)
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exponential lower bounds and separation for query rewriting
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Virtual views are a mechanism that facilitates re-use and makes queries easier to express. However the use of iterative view definitions makes very simple query evaluation and analysis problems more complex. In this paper we study classical containment and equivalence problems for queries built up through simple unions of conjunctive queries and view definitions. More precisely, we determine the complexity of containment and equivalence for non-recursive Datalog. We show that the problem is much harder than its classical counterpart -- complete for co-NEXPTIME. We then show that this remains true even with restrictions on the schema and queries in place. Finally, we isolate subcases that are more tractable, ranging from NP to PSPACE.