Matching dependencies with arbitrary attribute values: semantics, query answering and integrity constraints

Authors:
Jaffer Gardezi;Leopoldo Bertossi;Iluju Kiringa
Affiliations:
University of Ottawa, Ottawa, Canada;Carleton University, Ottawa, Canada;University of Ottawa, Ottawa, Canada
Venue:
Proceedings of the 4th International Workshop on Logic in Databases
Year:
2011

Citing 14
Cited 3

Consistent query answers in inconsistent databases

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Census Data Repair: a Challenging Application of Disjunctive Logic Programming

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Logics for Emerging Applications of Databases

Logics for Emerging Applications of Databases
Database repairing using updates

ACM Transactions on Database Systems (TODS)
Consistent query answering in databases

ACM SIGMOD Record
Duplicate Record Detection: A Survey

IEEE Transactions on Knowledge and Data Engineering
The complexity and approximation of fixing numerical attributes in databases under integrity constraints

Information Systems
Dependencies revisited for improving data quality

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data fusion

ACM Computing Surveys (CSUR)
Swoosh: a generic approach to entity resolution

The VLDB Journal — The International Journal on Very Large Data Bases
Reasoning about record matching rules

Proceedings of the VLDB Endowment
Querying and repairing inconsistent numerical databases

ACM Transactions on Database Systems (TODS)
Data cleaning and query answering with matching dependencies and matching functions

Proceedings of the 14th International Conference on Database Theory
Consistent query answering: five easy pieces

ICDT'07 Proceedings of the 11th international conference on Database Theory

Tractable cases of clean query answering under entity resolution via matching dependencies

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Query rewriting using datalog for duplicate resolution

Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Editorial: Efficient discovery of similarity constraints for matching dependencies

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditions are satisfied. Their enforcement can be seen as a natural generalization of entity resolution. In what we call the pure case of MDs, any value from the underlying data domain can be used for the value in common that does the matching. We investigate the semantics and properties of data cleaning through the enforcement of matching dependencies for the pure case. We characterize the intended clean instances and also the clean answers to queries as those that are invariant under the cleaning process. The complexity of computing clean instances and clean answers to queries is investigated. Tractable and intractable cases depending on the MDs are characterized.