Data cleaning and query answering with matching dependencies and matching functions

DOI10.1007/S00224-012-9402-7MaRDI QIDQ359881zbMATH OpenOpenAlexFDO

Authors Leopoldo Bertossi, Solmaz Kolahi, Laks V. S. Lakshmanan

Publication date 23 August 2013

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.3743, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.7424

zbMATH Keywords

latticedatabasesdata cleaningcertain answerentity resolutionmatching dependencymatching functionpossible answerquery relaxationsemantic domination

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Abstract: Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the values of some attributes for two tuples, provided that the values of some other attributes are sufficiently similar. Assuming the existence of matching functions for making two attributes values equal, we formally introduce the process of cleaning an instance using matching dependencies, as a chase-like procedure. We show that matching functions naturally introduce a lattice structure on attribute domains, and a partial order of semantic domination between instances. Using the latter, we define the semantics of clean query answering in terms of certain/possible answers as the greatest lower bound/least upper bound of all possible answers obtained from the clean instances. We show that clean query answering is intractable in some cases. Then we study queries that behave monotonically wrt semantic domination order, and show that we can provide an under/over approximation for clean answers to monotone queries. Moreover, non-monotone positive queries can be relaxed into monotone queries.

Recommendations

• Matching dependencies: semantics and query answering
• Extending inclusion dependencies with conditions
• A consistency cleaning method based on content-related conditional functional dependencies
• ERBlox: combining matching dependencies with machine learning for entity resolution
• Characterizing approximate-matching dependencies in formal concept analysis with pattern structures

Cites work

• scientific article; zbMATH DE number 1294230 (Why is no real title available?)
• scientific article; zbMATH DE number 1142322 (Why is no real title available?)
• A calculus for complex objects
• An introduction to duplicate detection.
• Answer sets for consistent query answering in inconsistent databases
• Incomplete Information in Relational Databases
• Matching dependencies: semantics and query answering
• On the expressive power of the relational algebra with partially ordered domains
• On the representation and querying of sets of possible worlds
• Scalar aggregation in inconsistent databases.
• Using powerdomains to generalize relational databases

Cited in

(7)

• Matching dependencies: semantics and query answering
• Expressive power of entity-linking frameworks
• Towards declarative comparabilities: application to functional dependencies
• ERBlox: combining matching dependencies with machine learning for entity resolution
• A consistency cleaning method based on content-related conditional functional dependencies
• Computing Dependencies Using FCA
• Policy-based inconsistency management in relational databases

This page was built for publication: Data cleaning and query answering with matching dependencies and matching functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359881)