A System for Tractable Computation of Negative Answers to Conjunctive Queries.
Jianfeng DuDeqian LiuCan LinXuzhi ZhouJiaqi LiangPublished in: CSWS (2014)
Keyphrases
- conjunctive queries
- np complete
- bounded treewidth
- queries using views
- query answering
- query evaluation
- integrity constraints
- data complexity
- complexity of query answering
- query language
- data exchange
- hypertree decomposition
- database theory
- special case
- query rewriting
- decision procedures
- boolean expressions
- query answers
- query containment
- probabilistic databases
- datalog programs
- fixed parameter tractable
- functional dependencies
- dl lite
- logic programs
- unions of conjunctive queries
- tuple generating dependencies
- metadata
- databases
- computational complexity
- data analysis
- data model
- np hard
- expressive power
- constraint satisfaction problems