Sciweavers

PODS
1999
ACM

Consistent Query Answers in Inconsistent Databases

13 years 8 months ago
Consistent Query Answers in Inconsistent Databases
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. This notion is captured in terms of the possible repaired versions of the database. A method for computing consistent answers is given and its soundness and completeness (for some classes of constraints and queries) proved. The method is based on an iterative procedure whose termination for several classes of constraints is proved as well.
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where PODS
Authors Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
Comments (0)