The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints.
Paraschos KoutrisJef WijsenPublished in: PODS (2015)
Keyphrases
- conjunctive queries
- primary key
- data complexity
- consistent query answering
- query answering
- integrity constraints
- query evaluation
- inconsistent databases
- np complete
- combined complexity
- query language
- query containment
- join queries
- special case
- data exchange
- probabilistic databases
- query rewriting
- datalog programs
- dl lite
- unions of conjunctive queries
- decision procedures
- incomplete information
- conp complete
- regular path queries
- functional dependencies
- query processing
- data management
- schema mappings
- expressive power
- answering queries
- transitive closure