Disjunctive databases for representing repairs

This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constraints is considered. We show that, given a database and a set of denial constraints, there exists a (unique) disjunctive database, called canonical, which represents the repairs of the database w.r.t. the constraints and is contained in any other disjunctive database with the same set of minimal models. We propose an algorithm for computing the canonical disjunctive database. Finally, we study the size of the canonical disjunctive database in the presence of functional dependencies for both subset-based repairs and cardinality-based repairs.

[1]  Jack Minker,et al.  Semantics of Disjunctive Deductive Databases , 1992, ICDT.

[2]  Jack Minker,et al.  Disjunctive Logic Programming: A Survey and Assessment , 2002, Computational Logic: Logic Programming and Beyond.

[3]  Phokion G. Kolaitis,et al.  Repair checking in inconsistent databases: algorithms and complexity , 2009, ICDT '09.

[4]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[5]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[6]  Sergio Greco,et al.  A Logical Framework for Querying and Repairing Inconsistent Databases , 2003, IEEE Trans. Knowl. Data Eng..

[7]  Leopoldo E. Bertossi,et al.  Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics , 2006, ICDT.

[8]  Jan Chomicki,et al.  Query Answering in Inconsistent Databases , 2003, Logics for Emerging Applications of Databases.

[9]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[10]  Jan Chomicki,et al.  Answer sets for consistent query answering in inconsistent databases , 2002, Theory and Practice of Logic Programming.

[11]  Jan Chomicki,et al.  Consistent Query Answering: Five Easy Pieces , 2007, ICDT.

[12]  Jan Chomicki,et al.  Minimal-change integrity maintenance using tuple deletions , 2002, Inf. Comput..

[13]  Maurice Bruynooghe,et al.  Distance semantics for database repair , 2007, Annals of Mathematics and Artificial Intelligence.

[14]  Dan Olteanu,et al.  10106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information , 2007, ICDE.

[15]  Tomasz Imielinski,et al.  Incomplete object—a data model for design and planning applications , 1991, SIGMOD '91.

[16]  Jennifer Widom,et al.  Databases with uncertainty and lineage , 2008, The VLDB Journal.

[17]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[18]  Andrea Calì,et al.  Query rewriting and answering under constraints in data integration systems , 2003, IJCAI.

[19]  Leopoldo E. Bertossi,et al.  The complexity and approximation of fixing numerical attributes in databases under integrity constraints , 2008, Inf. Syst..

[20]  Leopoldo E. Bertossi,et al.  Consistent query answering in databases , 2006, SGMD.

[21]  Tomasz Imielinski,et al.  Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information , 1995, J. Comput. Syst. Sci..