Consistent answers to boolean aggregate queries under aggregate constraints

  • Authors:
  • Sergio Flesca;Filippo Furfaro;Francesco Parisi

  • Affiliations:
  • DEIS, Università della Calabria, Rende, CS, Italy;DEIS, Università della Calabria, Rende, CS, Italy;DEIS, Università della Calabria, Rende, CS, Italy

  • Venue:
  • DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A framework for computing consistent answers to boolean aggregate queries in numerical databases violating a given set of aggregate constraints is introduced. Both aggregate constraints and queries are aggregation expressions consisting of linear inequalities on aggregate-sum functions. In particular, our approach works for a specific but expressive form of aggregation expressions (called steady aggregation expressions) and computes consistent answers by solving Integer Linear Programming (ILP) problem instances.