Preferred Database Repairs Under Aggregate Constraints

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

  • Affiliations:
  • DEIS - Università della Calabria, Via Bucci - 87036 Rende (CS), Italy;DEIS - Università della Calabria, Via Bucci - 87036 Rende (CS), Italy;DEIS - Università della Calabria, Via Bucci - 87036 Rende (CS), Italy

  • Venue:
  • SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A framework for computing preferred repairs in numerical databases violating a given set of strong and weak aggregate constraints is introduced, which is based on a transformation into an Integer Linear Programming (ILP) instance. Aggregate constraints are linear inequalities on aggregates retrieved from the input data. While strong constraints express mandatory conditions, weak constraints define conditions which are expected to be satisfied, even if this is not mandatory. Thus, preferred repairs are repairs which make the data satisfy all the given strong constraints and as many weak constraints as possible. An experimental validation of the proposed approach is provided, proving its effectiveness.