Tractable vs. Intractable Cases of Matching Dependencies for Query Answering under Entity Resolution.
Leopoldo E. BertossiJaffer GardeziPublished in: CoRR (2013)
Keyphrases
- entity resolution
- query answering
- data integration
- data exchange
- data cleaning
- data complexity
- tuple generating dependencies
- answering queries
- conjunctive queries
- data model
- record linkage
- np complete
- query processing
- computational complexity
- information extraction
- databases
- incomplete information
- data sources
- integrity constraints
- data management
- markov networks
- inconsistent databases
- data warehousing
- data warehouse
- schema mappings
- link prediction
- knowledge discovery
- complexity of query answering
- matching algorithm
- datalog programs
- business intelligence
- np hard