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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Agarwal, A.M. Keller, G. Wiederhold, and K. Saraswat. Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases. In IEEE International Conference on Data Engineering, 1995.
M. Arenas, L. Bertossi, and J. Chomicki. Consistent Query Answers in Inconsistent Databases. In Proc. ACM Symposium on Principles of Database Systems (ACM PODS’99, Philadelphia), pages 68–79, 1999.
C. Baral, S. Kraus, J. Minker, and V.S. Subrahmanian. Combining Knowledge Bases Consisting of First-Order Theories. Computational Intelligence, 8:45–71, 1992.
D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1994.
A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: A Survey. SIAM, 1999.
F. Bry. Query Answering in Information Systems with Integrity Constraints. In IFIP WG 11.5 Working Conference on Integrity and Control in Information Systems. Chapman & Hall, 1997.
A. K. Chandra and D. Harel. Computable Queries for Relational Databases. Journal of Computer and System Sciences, 21:156–178, 1980.
Phan Minh Dung. Integrating Data from Possibly Inconsistent Databases. In International Conference on Cooperative Information Systems, Brussels, Belgium, 1996.
Fanica Gavril. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. SIAM Journal on Computing, 1(2):180–187, 1972.
W-L. Hsu and G.L. Nemhauser. Algorithms for Minimum Covering by Cliques and Maximum Clique in Claw-free Perfect Graphs. Discrete Mathematics, 37:181–191, 1981.
T. Imieliński and W. Lipski. Incomplete Information in Relational Databases. Journal of the ACM, 31(4):761–791, 1984.
T. Imieliński, S. Naqvi, and K. Vadaparty. Incomplete Objects-A Data Model for Design and Planning Applications. In ACM SIGMOD International Conference on Management of Data, pages 288–297, Denver, Colorado, May 1991.
J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55–76, 1996.
R. van der Meyden. Logical Approaches to Incomplete Information: A Survey. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, chapter 10. Kluwer Academic Publishers, Boston, 1998.
M. Y. Vardi. The Complexity of Relational Query Languages. In ACM Symposium on Theory of Computing, pages 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arenas, M., Bertossi, L., Chomicki, J. (2001). Scalar Aggregation in FD-Inconsistent Databases. In: Van den Bussche, J., Vianu, V. (eds) Database Theory — ICDT 2001. ICDT 2001. Lecture Notes in Computer Science, vol 1973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44503-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-44503-X_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41456-8
Online ISBN: 978-3-540-44503-6
eBook Packages: Springer Book Archive