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.

[1]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[2]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[5]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[6]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[7]  George L. Nemhauser,et al.  Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs , 1981, Discret. Math..

[8]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[9]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[10]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[11]  L. G. Demichiel.  Performing database operations over mismatched domains , 1990 .

[12]  Tomasz Imielinski,et al.  Incomplete object—a data model for design and planning applications , 1991, SIGMOD '91.

[13]  Sarit Kraus,et al.  Combining Knowledge Bases Consisting of First Order Theories , 1991, ISMIS.

[14]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[15]  Pierluigi Crescenzi,et al.  Introduction to the theory of complexity , 1994, Prentice Hall international series in computer science.

[16]  Gio Wiederhold,et al.  Flexible relation: an approach for integrating data from multiple, possibly inconsistent databases , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[17]  Sergio Greco,et al.  DATALOG Queries with Stratified Negation and Choice: from P to DP , 1995, ICDT.

[18]  Arbee L. P. Chen,et al.  Evaluating Aggregate Operations Over Imprecise Data , 1996, IEEE Trans. Knowl. Data Eng..

[19]  Divesh Srivastava,et al.  Answering Queries with Aggregation Using Views , 1996, VLDB.

[20]  Phan Minh Dung,et al.  Integrating data from possibly inconsistent databases , 1996, Proceedings First IFCIS International Conference on Cooperative Information Systems.

[21]  Alon Y. Halevy,et al.  Reasoning with Aggregation Constraints , 1996, EDBT.

[22]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[23]  François Bry,et al.  Query Answering in Information Systems with Integrity Constraints , 1997, IICIS.

[24]  Alberto O. Mendelzon,et al.  Merging Databases Under Constraints , 1998, Int. J. Cooperative Inf. Syst..

[25]  Dino Pedreschi,et al.  Datalog with Non-Deterministic Choice Computers NDB-PTIME , 1998, J. Log. Program..

[26]  Ron van der Meyden,et al.  Logical Approaches to Incomplete Information: A Survey , 1998, Logics for Databases and Information Systems.

[27]  Kenneth A. Ross,et al.  Foundations of Aggregation Constraints , 1994, Theor. Comput. Sci..

[28]  Werner Nutt,et al.  Algorithms for Rewriting Aggregate Queries Using Views , 2000, DMDW.

[29]  Werner Nutt,et al.  Rewriting aggregate queries using views , 1999, PODS.

[30]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[31]  Michael Kifer,et al.  Applications of Annotated Predicate Calculus to Querying Inconsistent Databases , 2000, Computational Logic.

[32]  Jan Chomicki,et al.  Specifying and Querying Database Repairs using Logic Programs with Exceptions , 2000, FQAS.

[33]  Sergio Greco,et al.  A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases , 2001, ICLP.

[34]  Xin He,et al.  Scalar aggregation in inconsistent databases , 2003, Theor. Comput. Sci..