Immutably answering Why-Not questions for equivalent conjunctive queries.
Nicole BidoitMelanie HerschelKaterina TzompanakiPublished in: Ingénierie des Systèmes d Inf. (2015)
Keyphrases
- conjunctive queries
- query answering
- data exchange
- integrity constraints
- data complexity
- answering queries
- query evaluation
- query containment
- query language
- query rewriting
- data integration
- np complete
- incomplete information
- special case
- decision procedures
- boolean expressions
- datalog programs
- probabilistic databases
- databases
- schema mappings
- bounded treewidth
- unions of conjunctive queries
- queries using views
- data sets
- computational complexity
- dl lite
- relational queries
- conp complete
- tuple generating dependencies
- conjunctive regular path queries