Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)


We here introduce the notions which are fundamental for dealing with the problem of extracting reliable information from (inconsistent) data in the presence of aggregate constraints. Specifically, we formalize the basic concepts of aggregate constraint, repair, repair minimality, and consistent answer, which will be exploited in the following chapters to define a general framework for repairing and querying inconsistent numerical data. We also provide a brief overview of the complexity classes which will be referred to when addressing the complexity characterization of several problems related to the above-mentioned framework.


Turing Machine Aggregation Function Integrity Constraint Relation Scheme Database Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© The Author(s) 2011

Authors and Affiliations

  • Sergio Flesca
    • 1
  • Filippo Furfaro
    • 1
  • Francesco Parisi
    • 1
  1. 1.Dipartimento di Elettronica Informatica e SistemisticaUniversità della CalabriaRendeItaly

Personalised recommendations