Proceedings of the 14th International Conference on Database Theory 2011
DOI: 10.1145/1938551.1938585
|View full text |Cite
|
Sign up to set email alerts
|

Data cleaning and query answering with matching dependencies and matching functions

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 matchi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
95
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 59 publications
(95 citation statements)
references
References 45 publications
(67 reference statements)
0
95
0
Order By: Relevance
“…The same holds for mapping & cleaning scenarios. Furthermore, some of the ingredients of our scenarios are inspired by, but different from, features of other repairing approaches (e.g., repairing based on both premise and conclusion of constraints [18], [10], cells [10], [9], groups of cells [9], partial orders and its incorporation in the chase [21]). As previously observed, these approaches support limited classes of constraints.…”
Section: Related Workmentioning
confidence: 99%
“…The same holds for mapping & cleaning scenarios. Furthermore, some of the ingredients of our scenarios are inspired by, but different from, features of other repairing approaches (e.g., repairing based on both premise and conclusion of constraints [18], [10], cells [10], [9], groups of cells [9], partial orders and its incorporation in the chase [21]). As previously observed, these approaches support limited classes of constraints.…”
Section: Related Workmentioning
confidence: 99%
“…A number of recent research [4,7,10] have investigated the data cleaning problem introduced in [2]: repairing is to find another database that is consistent and minimally differs from the original database. They compute a consistent database by using di↵erent cost functions for value updates ⇤ Work done while interning at QCRI.…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, state of the art approaches (e.g., [9], [10], [11]) attempt to clean data by exploiting patterns in the data, which they express in the form of conditional functional dependencies (or CFDs). However, these approaches depend on the availability of a clean data corpus or an external reference table to learn data quality rules or patterns before fixing the errors in the dirty data.…”
Section: Introductionmentioning
confidence: 99%