Information integration using logical views

  • Jeffrey D. Ullman
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1186)

Abstract

A number of ideas concerning information-integration tools can be thought of as constructing answers to queries using views that represent the capabilities of information sources. We review the formal basis of these techniques, which are closely related to containment algorithms for conjunctive queries and/or Datalog programs. Then we compare the approaches taken by AT&T Labs' “Information Manifold” and the Stanford “Tsimmis” project in these terms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A97]
    Abiteboul, S. Querying semistructured data. These proceedings.Google Scholar
  2. [Bor96]
    Borgida, A.. On the relative expressiveness of description logics and predicate logics. Artificial Intelligence 82, pp. 353–367, 1996.Google Scholar
  3. [CM77]
    Chandra, A. K. and P. M. Merlin. Optimal implementation of conjunctive queries in relational databases. Proc. Ninth Annual ACM Symposium on the Theory of Computing, pp. 77–90, 1977.Google Scholar
  4. [C*95]
    [C*95] Chaudhuri, S., R. Krishnamurthy, S. Potamianos, and K. Shim. Optimizing queries with materialized views. Intl. Conf. on Data Engineering, 1995.Google Scholar
  5. [CV92]
    Chaudhuri, S. and M. Y. Vardi. On the equivalence of datalog programs. Proc. Eleventh ACM Symposium on Principles of Database Systems, pp. 55–66, 1992.Google Scholar
  6. [C*89]
    [C*89] Chen, W., M. Kifer, and D. S. Warren. HiLog: a first order semantics for higher order programming constructs. in Second Intl. Workshop on Database Programming Languages, Morgan-Kaufmann, San Francisco, 1989.Google Scholar
  7. [GM*95]
    [GM*95] Garcia-Molina, H., Y. Papakonstantinou, D. Quass, A. Rajaraman, Y. Sagiv, J. Ullman, and J. Widom. The TSIMMIS approach to mediation: data models and languages. Second Workshop on Next-Generation Information Technologies and Systems, Naharia, Israel, June, 1995.Google Scholar
  8. [G96]
    http://www-i.almaden.ibm.com/cs/showtell/garlic/Initpage.htmlGoogle Scholar
  9. [K*95]
    [K*95] Kirk, T., A. Y. Levy, Y. Sagiv, and D. Srivastava. The Information Manifold. AAAI Spring Symp. on Information Gathering, 1995.Google Scholar
  10. [Klug88]
    Klug, A.. On conjunctive queries containing inequalities. J. ACM 35:1, pp. 146–160, 1988.Google Scholar
  11. [L*95]
    [L*95] Levy, A., A. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. Proc. Fourteenth ACM Symposium on Principles of Database Systems, pp. 113–124, 1995.Google Scholar
  12. [L*96a]
    [L*96a] Levy, A. Y., A. Rajaraman, and J. J. Ordille. Querying heterogeneous information sources using source descriptions. Intl. Conf. on Very Large Databases, Sept., 1996.Google Scholar
  13. [L*96b]
    [L*96b] Levy, A. Y., A. Rajaraman, and J. J. Ordille. Query answering algorithms for information agents. 13th Natl. Conf. on AI, Aug., 1996.Google Scholar
  14. [LRU96]
    Levy, A. Y., A. Rajaraman, and J. D. Ullman. Answering queries using limited external processors. Proc. Fifteenth ACM Symposium on Principles of Database Systems, pp. 227–237, 1996.Google Scholar
  15. [LR96]
    Levy, A. Y. and M.-C. Rousset. CARIN: A representation language combining Horn rules and description logics. 13th European Conf. on AI, Budapest, Aug., 1996.Google Scholar
  16. [LS93]
    Levy, A. Y. and Y. Sagiv. Queries independent of update. Proc. International Conference on Very Large Data Bases, pp. 171–181, 1993.Google Scholar
  17. [P96]
    Papakonstantinou, Y. Query processing in heterogeneous information sources. PhD thesis, Dept. of CS, Stanford University, 1996.Google Scholar
  18. [P*95a]
    [P*95a] Papakonstantinou Y., H. Garcia-Molina, and J. Widom. Object exchange across heterogeneous information sources. Intl. Conf. on Data Engineering, March, 1995.Google Scholar
  19. [P*95b]
    [P*95b] Papakonstantinou, Y., A. Gupta, H. Garcia-Molina, and J. D. Ullman. A query translation scheme for rapid implementation of wrappers. Fourth DOOD, Singapore, Dec., 1995.Google Scholar
  20. [RSU95]
    Rajaraman, A., Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. Proc. Fourteenth ACM Symposium on Principles of Database Systems, pp. 105–112, 1995.Google Scholar
  21. [R*89]
    [R*89] Ramakrishnan, R., Y. Sagiv, J. D. Ullman, and M. Y. Vardi. Proof tree transformation theorems and their applications. Proc. Eighth ACM Symposium on Principles of Database Systems, pp. 172–181, 1989.Google Scholar
  22. [Sar91]
    Saraiya, Y. Subtree elimination algorithms in deductive databases. Doctoral Thesis, Dept. of CS, Stanford Univ., Jan., 1991.Google Scholar
  23. [Shm87]
    Shmueli, O. Decidability and expressiveness aspects of logic queries. Proc. Sixth ACM Symposium on Principles of Database Systems, pp 237–249, 1987.Google Scholar
  24. [T96]
    http://db.stanford.edu/tsimmisGoogle Scholar
  25. [Ull88]
    Ullman, J. D. Principles of Database and Knowledge-Base Systems, Vol. I. Computer Science Press, New York.Google Scholar
  26. [Ull89]
    Ullman, J. D. Principles of Database and Knowledge-Base Systems, Vol. II. Computer Science Press, New York.Google Scholar
  27. [Ull94]
    Ullman, J. D. Assigning an appropriate meaning to database logic with negation. in Computers as Our Better Partners (H. Yamada, Y. Kambayashi, and S. Ohta, eds.), pp. 216–225, World Scientific Press.Google Scholar
  28. [vdM92]
    van der Meyden, R. The complexity of querying indefinite data about linearly ordered domains. Proc. Eleventh ACM Symposium on Principles of Database Systems, pp. 331–345, 1992.Google Scholar
  29. [Wid95]
    Widom, J. Research problems in data warehousing. Fourth Intl. Conf. on Information and Knowledge Management, pp. 25–30, 1995.Google Scholar
  30. [Wie92]
    Wiederhold, G.. Mediators in the architecture of future information systems. IEEE Computer 25:3, pp. 38–49, 1992.Google Scholar
  31. [YL87]
    Yang, H. Z. and P. A. Larson. Query transformation for PSJ queries. Proc. International Conference on Very Large Data Bases, pp. 245–254, 1987.Google Scholar
  32. [ZO93]
    Zhang, X. and M. Z. Ozsoyoglu. On efficient reasoning with implication constraints. Proc. Third DOOD Conference, pp. 236–252.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Jeffrey D. Ullman
    • 1
  1. 1.Stanford UniversityUSA

Personalised recommendations