On the Complexity of Bounded View Propagation for Conjunctive Queries.
Dongjing MiaoZhipeng CaiJianzhong LiPublished in: IEEE Trans. Knowl. Data Eng. (2018)
Keyphrases
- conjunctive queries
- bounded treewidth
- conjunctive query containment
- data complexity
- integrity constraints
- combined complexity
- query answering
- query evaluation
- np complete
- fixed parameter tractable
- conjunctive regular path queries
- view definitions
- conp complete
- query language
- decision procedures
- hypertree width
- query rewriting
- special case
- data exchange
- containment of conjunctive queries
- datalog programs
- decision problems
- lower complexity
- query containment
- pspace complete
- probabilistic databases
- computational complexity
- boolean expressions
- exptime complete
- double exponential
- expressive power
- data integration
- xml data
- hypertree decomposition
- np hard
- data sets