First-order query rewriting for inconsistent databases

  • Authors:
  • Ariel Fuxman;Renée J. Miller

  • Affiliations:
  • Department of Computer Science, University of Toronto, Canada;Department of Computer Science, University of Toronto, Canada

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2007

Quantified Score

Hi-index 0.03

Visualization

Abstract

We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to a set of integrity constraints. In particular, we concentrate on sets of constraints that consist of key dependencies, and we give an algorithm that computes the consistent answers for a large and practical class of conjunctive queries. Given a query q, the algorithm returns a first-order query Q (called a query rewriting) such that for every (potentially inconsistent) database I, the consistent answers for q can be obtained by evaluating Q directly on I.