Tractable vs. Intractable Cases of Query Answering under Matching Dependencies.
Leopoldo E. BertossiJaffer GardeziPublished in: SUM (2014)
Keyphrases
- query answering
- data exchange
- tuple generating dependencies
- data complexity
- np complete
- integrity constraints
- conjunctive queries
- computational complexity
- data integration
- incomplete information
- answering queries
- query rewriting
- pattern matching
- matching algorithm
- data sets
- query containment
- query answers
- xml data exchange
- inconsistent databases
- data integration systems
- inclusion dependencies
- datalog programs
- deductive databases
- data model