Key points are not available for this paper at this time.
Data cleaning is an important problem and data quality rules are the most promising way to face it with a declarative approach. Previous work has focused on specific formalisms, such as functional dependencies (FDs), conditional functional dependencies (CFDs), and matching dependencies (MDs), and those have always been studied in isolation. Moreover, such techniques are usually applied in a pipeline or interleaved. In this work we tackle the problem in a novel, unified framework. First, we let users specify quality rules using denial constraints with ad-hoc predicates. This language subsumes existing formalisms and can express rules involving numerical values, with predicates such as “greater than” and “less than”. More importantly, we exploit the interaction of the heterogeneous constraints by encoding them in a conflict hypergraph. Such holistic view of the conflicts is the starting point for a novel definition of repair context which allows us to compute automatically repairs of better quality w.r.t. previous approaches in the literature. Experimental results on real datasets show that the holistic approach outperforms previous algorithms in terms of quality and efficiency of the repair.
Building similarity graph...
Analyzing shared references across papers
Loading...
Xu Chu
Hunan University
Ihab F. Ilyas
Qatar Airways (Qatar)
Paolo Papotti
Roma Tre University
University of Waterloo
Qatar Airways (Qatar)
Building similarity graph...
Analyzing shared references across papers
Loading...
Chu et al. (Mon,) studied this question.
synapsesocial.com/papers/6a0ec1fd2eca052da647c0ad — DOI: https://doi.org/10.1109/icde.2013.6544847