Tableau Techniques for Querying Information Sources through Global Schemas

The foundational homomorphism techniques introduced by Chandra and Merlin for testing containment of conjunctive queries have recently attracted renewed interest due to their central role in information integration applications. We show that generalizations of the classical tableau representation of conjunctive queries are useful for computing query answers in information integration systems where information sources are modeled as views defined on a virtual global schema. We consider a general situation where sources may or may not be known to be correct and complete. We characterize the set of answers to a global query and give algorithms to compute a finite representation of this possibly infinite set, as well as its certain and possible approximations. We show how to rewrite a global query in terms of the sources in two special cases, and show that one of these is equivalent to the Information Manifold rewriting of Levy et al.

[1]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[2]  Serge Abiteboul,et al.  On the Representation and Querying of Sets of Possible Worlds , 1991, Theor. Comput. Sci..

[3]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..

[4]  Joann J. Ordille,et al.  Querying Heterogeneous Information Sources Using Source Descriptions , 1996, VLDB.

[5]  Alon Y. Levy.  Obtaining Complete Answers from Incomplete Databases , 1996, VLDB 1996.

[6]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

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

[8]  Serge Abiteboul,et al.  On the representation and querying of sets of possible worlds , 1987, SIGMOD '87.

[9]  Gösta Grahne,et al.  The Problem of Incomplete Information in Relational Databases , 1991, Lecture Notes in Computer Science.

[10]  Marvin H. Solomon,et al.  The GMAP: a versatile tool for physical data independence , 1996, The VLDB Journal.

[11]  Serge Abiteboul,et al.  Complexity of answering queries using materialized views , 1998, PODS.

[12]  Catriel Beeri,et al.  The Implication Problem for Data Dependencies , 1981, ICALP.

[13]  Marianne Winslett,et al.  Updating logical databases , 1990, Cambridge tracts in theoretical computer science.

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

[15]  Paris C. Kanellakis,et al.  Constraint programming and database languages: a tutorial , 1995, PODS '95.

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

[17]  Amihai Motro,et al.  Multiplex: A Formal Model for Multidatabases and Its Implementation , 1999, NGITS.

[18]  Alberto O. Mendelzon.  Database states and their tableaux , 1984, TODS.

[19]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[20]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[21]  Jeffrey D. Ullman,et al.  The U. R. strikes back , 1982, PODS.

[22]  Ron van der Meyden.  Recursively Indefinite Databases , 1993, Theor. Comput. Sci..

[23]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[24]  Alon Y. Halevy,et al.  Obtaining Complete Answers from Incomplete Databases , 1996, VLDB.

[25]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[26]  David Maier,et al.  Window Functions , 1986, Advances in Computational Research.

[27]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.