Disjunctive databases for representing repairs

Authors:
Cristian Molinaro;Jan Chomicki;Jerzy Marcinkowski
Affiliations:
DEIS, Universitá della Calabria, Rende (CS), Italy 87036;Department of Computer Science and Engineering, 201 Bell Hall, The State University of New York at Buffalo, Buffalo, USA 14260;Institute of Informatics, Wroclaw University, Wroclaw, Poland 51-151
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2009

Citing 19
Cited 0

Incomplete object—a data model for design and planning applications

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Complexity tailored design: a new design methodology for databases with incomplete information

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Consistent query answers in inconsistent databases

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantics of Disjunctive Deductive Databases

ICDT '92 Proceedings of the 4th International Conference on Database Theory
Disjunctive Logic Programming: A Survey and Assessment

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Logical Framework for Querying and Repairing Inconsistent Databases

IEEE Transactions on Knowledge and Data Engineering
Answer sets for consistent query answering in inconsistent databases

Theory and Practice of Logic Programming
Consistent query answering in databases

ACM SIGMOD Record
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Distance semantics for database repair

Annals of Mathematics and Artificial Intelligence
Databases with uncertainty and lineage

The VLDB Journal — The International Journal on Very Large Data Bases
The complexity and approximation of fixing numerical attributes in databases under integrity constraints

Information Systems
Repair checking in inconsistent databases: algorithms and complexity

Proceedings of the 12th International Conference on Database Theory
Query rewriting and answering under constraints in data integration systems

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Minimal-change integrity maintenance using tuple deletions

Information and Computation
Consistent query answering: five easy pieces

ICDT'07 Proceedings of the 11th international conference on Database Theory
Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics

ICDT'07 Proceedings of the 11th international conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.