Skip to main content
SpringerLink
Log in

Tableau Techniques for Querying Information Sources through Global Schemas

  • Conference paper
  • First Online:
Database Theory — ICDT’99 (ICDT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1540))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul S., O. M. Duschka: Complexity of Answering Queries Using Materialized Views. Proc. 9th Annual ACM Symp. on the Theory of Computing, pp. 254–263.

    Google Scholar 

  2. Abiteboul S., R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading Ma. 1995.

    MATH  Google Scholar 

  3. Abiteboul S., P. C. Kanellakis, G. Grahne. On the Representation and Querying of Sets of Possible Worlds. Theoretical Computer Science 78:1, 1991, pp. 158–187

    MathSciNet  Google Scholar 

  4. Aho A.V., Y. Sagiv, J. D. Ullman. Equivalences Among Relational Expressions. SIAM J. Comput. 8:2, 1979, pp. 218–246

    Article  MATH  MathSciNet  Google Scholar 

  5. Beeri C, M. Y. Vardi. The Implication Problem for Data Dependencies. Proc. 8th International Colloquium on Automata, Languages and Programming, pp. 73–85

    Google Scholar 

  6. Chandra A.K. and Merlin P. M. Optimal implementation of conjunctive queries in relational databases. Conference Record of the 9th Annual ACM Symposium on Theory of Computing, pp. 77–90.

    Google Scholar 

  7. Fagin R., G. M. Kuper, J. D. Ullman, M. Y. Vardi. Updating Logical Databases. In P. C. Kanellakis and F. Preparata (Editors) Advances in Computing Research, Vol. 3, pp. 1–18. JAI Press Inc., Greenwich, CT, 1986.

    Google Scholar 

  8. Grahne G. The Problem of Incomplete Information in Relational Databases. Lecture Notes in Computer Science, vol. 554. Springer-Verlag, Berlin 1991.

    MATH  Google Scholar 

  9. Imielinski T, W. Lipski Jr. Incomplete Information in Relational Databases. J. ACM 31:4, 1984, pp. 761–791

    Article  MATH  MathSciNet  Google Scholar 

  10. Kanellakis P.C. Constraint Programming and Database Languages: A Tutorial. Proc. 14th ACM Symp. on Principles of Database Systems, pp. 46–53.

    Google Scholar 

  11. Kanellakis P.C., G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Proc. 9th ACM Symp. on Principles of Database Systems, pp. 299–313.

    Google Scholar 

  12. Levy A.Y. Obtaining Complete Answers from Incomplete Databases. Proc. 22nd Int’l. Conf. on Very Large Databases, pp. 402–412.

    Google Scholar 

  13. Levy A.Y., A. O. Mendelzon, Y. Sagiv, D. Srivastava: Answering Queries Using Views. Proc. 14th ACM Symp. on Principles of Database Systems, pp. 95–104.

    Google Scholar 

  14. Levy A.Y., A. Rajaraman and J. J. Ordille. Querying Heterogeneous Information Sources Using Source Descriptions. Proc. 22nd Int’l. Conf. on Very Large Databases, pp. 251–262.

    Google Scholar 

  15. Maier D., D. Rozenshtein, D. S. Warren. Window Functions. In P. C. Kanellakis and F. Preparata (Editors) Advances in Computing Research, Vol. 3, pp. 213–246, JAI Press Inc., Greenwich, CT, 1986.

    Google Scholar 

  16. Mendelzon A.O. Database States and Their Tableaux. ACM Trans. on Databases Systems 9:2, 1984, pp. 264–282

    Article  MATH  MathSciNet  Google Scholar 

  17. Motro A. Multiplex: A Formal Model for Multidatabases and Its Implementation. Technical Report ISSE-TR-95-103.

    Google Scholar 

  18. van der Meyden R. Recursively Indefinite Databases, Theoretical Computer Science 116(1,2), 1993, pp. 151–194

    Article  MATH  MathSciNet  Google Scholar 

  19. van der Meyden R. Logical Approaches to Incomplete Information: A Survey. In J. Chomicki and G. Saake (Editors) Logics for Databases and Information Systems. Kluwer Academic Publishers, 1998, pp. 307–356

    Google Scholar 

  20. Tsatalos, O.G, M.H. Solomon, Y.E. Ioannidis. The GMAP: A Versatile Tool for Physical Data Independence. Proc. 20th Int’l. Conf. on Very Large Databases, pp. 367–378.

    Google Scholar 

  21. Ullman J.D. The U. R. Strikes Back. Proc. 1st ACM Symp. on Principles of Database Systems, pp. 10–22.

    Google Scholar 

  22. Ullman J.D. Information Integration Using Logical Views. Proc. 6th Int’l. Symp. on Database Theory, pp. 19–40.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Concordia University, Montreal, Quebec, Canada, H3G 1M8

    Gösta Grahne

  2. Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, M5S 3H5

    Alberto O. Mendelzon

Authors
  1. Gösta Grahne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto O. Mendelzon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, The Hebrew University, Givat-Ram, Jerusalem, 91940, Israel

    Catriel Beeri

  2. Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 19104-6389, USA

    Peter Buneman

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grahne, G., Mendelzon, A.O. (1999). Tableau Techniques for Querying Information Sources through Global Schemas. In: Beeri, C., Buneman, P. (eds) Database Theory — ICDT’99. ICDT 1999. Lecture Notes in Computer Science, vol 1540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49257-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-49257-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65452-0

  • Online ISBN: 978-3-540-49257-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation