Scalar Aggregation in FD-Inconsistent Databases
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.
KeywordsMaximum Clique Integrity Constraint Perfect Graph Database Instance Consistent Answer
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 2.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.Google Scholar
- 4.D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1994.Google Scholar
- 5.A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: A Survey. SIAM, 1999.Google Scholar
- 6.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.Google Scholar
- 8.Phan Minh Dung. Integrating Data from Possibly Inconsistent Databases. In International Conference on Cooperative Information Systems, Brussels, Belgium, 1996.Google Scholar
- 12.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.Google Scholar
- 14.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.Google Scholar
- 15.M. Y. Vardi. The Complexity of Relational Query Languages. In ACM Symposium on Theory of Computing, pages 137–146, 1982.Google Scholar