Consistent Query Answers on Numerical Databases Under Aggregate Constraints

  • Sergio Flesca
  • Filippo Furfaro
  • Francesco Parisi
Conference paper

DOI: 10.1007/11601524_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3774)
Cite this paper as:
Flesca S., Furfaro F., Parisi F. (2005) Consistent Query Answers on Numerical Databases Under Aggregate Constraints. In: Bierman G., Koch C. (eds) Database Programming Languages. DBPL 2005. Lecture Notes in Computer Science, vol 3774. Springer, Berlin, Heidelberg

Abstract

The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defined as linear inequalities on aggregate-sum queries on input data are considered. The notion of repair as consistent set of updates at attribute-value level is exploited, and the characterization of several data-complexity issues related to repairing data and computing consistent query answers is provided.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Sergio Flesca
    • 1
  • Filippo Furfaro
    • 1
  • Francesco Parisi
    • 1
  1. 1.DEISUniversità della CalabriaRende (CS)ITALY

Personalised recommendations