The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views.
Rada ChirkovaPublished in: PODS (2002)
Keyphrases
- conjunctive queries
- lower bound
- query rewriting
- queries using views
- answering queries using views
- query answering
- upper bound
- view definitions
- query evaluation
- regular path queries
- integrity constraints
- query language
- np complete
- data complexity
- np hard
- query containment
- special case
- decision procedures
- data exchange
- boolean expressions
- optimal solution
- objective function
- branch and bound
- database
- datalog programs
- probabilistic databases
- functional dependencies
- deductive databases
- containment of conjunctive queries
- answering queries
- bounded treewidth
- computational complexity
- data model
- unions of conjunctive queries
- conjunctive query containment