Sciweavers

ICDT
2009
ACM

Repair checking in inconsistent databases: algorithms and complexity

14 years 10 days ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framework of database repairs, which has been the topic of an extensive investigation over the past several years. Intuitively, a repair of an inconsistent database is a consistent database that differs from the given inconsistent database in a minimal way. So far, most of the work in this area has addressed the problem of obtaining the consistent answers to a query posed on an inconsistent database. Repair checking is the following decision problem: given two databases r and r , is r a repair of r? Although repair checking is a fundamental algorithmic problem about inconsistent databases, it has not received as much attention as consistent query answering. In this paper, we give a polynomial-time algorithm for subset-repair checking under integrity constraints that are the union of a weakly acyclic set of local-as-...
Foto N. Afrati, Phokion G. Kolaitis
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where ICDT
Authors Foto N. Afrati, Phokion G. Kolaitis
Comments (0)