Consistent query answers on numerical databases under aggregate constraints
数据库
2007-05-23 v1
摘要
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 complexity issues related to repairing data and computing consistent query answers is provided.
引用
@article{arxiv.cs/0505059,
title = {Consistent query answers on numerical databases under aggregate constraints},
author = {Sergio Flesca and Filippo Furfaro and Francesco Parisi},
journal= {arXiv preprint arXiv:cs/0505059},
year = {2007}
}