Abstract
The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints denned 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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Flesca, S., Furfaro, F., & Parisi, F. (2005). Consistent query answers on numerical databases under aggregate constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3774 LNCS, pp. 279–294). Springer Verlag. https://doi.org/10.1007/11601524_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
