Scalar aggregation in inconsistent databases

  • Authors:
  • Marcelo Arenas;Leopoldo Bertossi;Jan Chomicki;Xin He;Vijay Raghavan;Jeremy Spinrad

  • Affiliations:
  • Department of Computer Science, University of Toronto, Toronto, Ont., Canada;School of Computer Science, Carleton University, Ottawa, Ont., Canada;Department of Computer Science and Engineering, 201 Bell Hall, University at Buffalo, Buffalo, NY;Department of Computer Science and Engineering, 201 Bell Hall, University at Buffalo, Buffalo, NY;EECS Department, Vanderbilt University;EECS Department, Vanderbilt University

  • Venue:
  • Theoretical Computer Science - Database theory
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. We define consistent answers to such queries to be greatest-lowest/least-upper bounds on the value of the scalar function across all (minimal) repairs of the database. We show how to compute such answers. We provide a complete characterization of the computational complexity of this problem. We also show how tractability can be improved in several special cases (one involves a novel application of Boyce-Codd Normal Form) and present a practical hybrid query evaluation method.