The complexity and approximation of fixing numerical attributes in databases under integrity constraints

  • Authors:

  • Leopoldo Bertossi;Loreto Bravo;Enrico Franconi;Andrei Lopatenko

  • Affiliations:

  • Carleton University, School of Computer Science, Ottawa, Canada;University of Edinburgh, School of Informatics, UK;Free University of Bozen-Bolzano, Faculty of Computer Science, Italy;Google Inc., Mountain View, CA, USA

  • Venue:
  • Information Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constraints. Consistent answers are characterized as those answers that are invariant under all minimally repaired versions of the original database. We study the problem of repairing databases with respect to denial constraints by fixing integer numerical values taken by attributes. We introduce a quantitative definition of database repair, and investigate the complexity of several decision and optimization problems. Among them, Database Repair Problem (DRP): deciding the existence of repairs within a given distance to the original instance, and CQA: deciding consistency of answers to simple and aggregate conjunctive queries under different semantics. We provide sharp complexity bounds, identifying relevant tractable and intractable cases. We also develop approximation algorithms for the latter. Among other results, we establish: (a) The @D"2^P-hardness of CQA. (b) That DRP is MAXSNP-hard, but has a good approximation. (c) The intractability of CQA for aggregate queries for one database atom denials (plus built-ins), and also that it has a good approximation.