Abstract
We consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. We show how to compute consistent answers (answers true in every minimal repair of the database) to such queries. We provide a complete characterization of the computational complexity of this problem. We also show how tractability can be obtained in several special cases (one involves a novel application of the perfect graph theory) and present a practical hybrid query evaluation method.
Cite
CITATION STYLE
Arenas, M., Bertossi, L., & Chomicki, J. (2001). Scalar aggregation in fd-inconsistent databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1973, pp. 39–53). Springer Verlag. https://doi.org/10.1007/3-540-44503-x_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
