Abstract
Data-cleaning (or data-repairing) is considered a crucial problem in many database-related tasks. It consists in making a database consistent with respect to a set of given constraints. In recent years, repairing methods have been proposed for several classes of constraints. However, these methods rely on ad hoc decisions and tend to hard-code the strategy to repair conflicting values. As a consequence, there is currently no general algorithm to solve database repairing problems that involve different kinds of constraints and different strategies to select preferred values. In this paper we develop a uniform framework to solve this problem. We propose a new semantics for repairs, and a chase-based algorithm to compute minimal solutions. We implemented the framework in a DBMSbased prototype, and we report experimental results that confirm its good scalability and superior quality in computing repairs.
Original language | English (US) |
---|---|
Pages (from-to) | 625-636 |
Number of pages | 12 |
Journal | Proceedings of the VLDB Endowment |
Volume | 6 |
Issue number | 9 |
DOIs | |
State | Published - 2013 |
Externally published | Yes |
Event | 39th International Conference on Very Large Data Bases, VLDB 2012 - Trento, Italy Duration: Aug 26 2013 → Aug 30 2013 |
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- General Computer Science