Answering Queries Using Materialized Views with Disjunctions

  • Foto N. Afrati
  • Manolis Gergatsoulis
  • Theodoros Kavalieros
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1540)

Abstract

We consider the problem of answering datalog queries using materialized views. More specifically, queries are rewritten to refer to views instead of the base relations over which the queries were originally written. Much work has been done on program rewriting that produces an equivalent query. In the context of information integration, though, the importance of using views to infer as many answers as possible has been pointed out. Formally, the problem is: Given a datalog program P is there a datalog program P v which uses only views as EDB predicates and (i) produces a subset of the answers that P produces and (ii) any other program P′ v over the views with property (i) is contained in P v ? In this paper we investigate the problem in the case of disjunctive view definitions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. In Proc. ACM Symposium on Principles of Database Systems, 1998.Google Scholar
  2. [2]
    Serge Abiteboul. Querying semi-structured data. In Proceedings of the Sixth International Conference on Database Theory, pages 1–18. Springer-Verlag, 1997.Google Scholar
  3. [3]
    F. Afrati, S. Cosmadakis, and M. Yannakakis. On datalog vs. polynomial time. J. Computer and Systems Sciences, 51(2):117–196, 1995.MathSciNetGoogle Scholar
  4. [4]
    Surajit Chaudhuri, Ravi Krishnamurthy, Spyros Potamianos, and Kyuseak Shim. Optimizing queries with materialized views. In Proceedings of the 11th International Conference on Data Engineering, Los Alamitos, CA, pages 190–200. IEEE Comput. Soc. Press, 1995.Google Scholar
  5. [5]
    Chandra Chekuri and Anand Rajaraman. Conjunctive query containment revisited. In Proceedings of the Sixth International Conference on Database Theory, pages 56–70. Springer-Verlag, 1997.Google Scholar
  6. [6]
    Oliver M. Duschka. Query Planning and Optimization in Information Integration. PhD thesis, Stanford University, December 1997.Google Scholar
  7. [7]
    Oliver M. Duschka and Michael R. Genesereth. Answering recursive queries using views. In Proc. 16th ACM SIGACT-SIGMOD-GIGART Symposium on Principles of Database Systems, pages 109–116, 1997.Google Scholar
  8. [8]
    Oliver M. Duschka and Michael R. Genesereth. Query planning with disjunctive sources. In Proc. of the AAAI-98 Workshop on AI and Information Integration, 1998.Google Scholar
  9. [9]
    M. Gergatsoulis. Correctness-preserving transformations for disjunctive logic programs. Demo 97/2, Institute of Informatics & Telecom. NCSR ‘Demokritos’, 1997.Google Scholar
  10. [10]
    Manolis Gergatsoulis. Unfold/fold transformations for disjunctive logic programs. Information Processing Letters, 62(1):23–29, April 1997.CrossRefMathSciNetGoogle Scholar
  11. [11]
    M. A. Harrison. Introduction to formal language theory. Addison-Wesley, 1978.Google Scholar
  12. [12]
    Nam Huyn. A more aggressive use of views to extract information. Technical Report STAN-CS-TR-96-1577, Stanford University, Computer Science Department, 1996.Google Scholar
  13. [13]
    Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, and Divesh Srivastava. Answering queries using views. In Proc. 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 95–104, 1995.Google Scholar
  14. [14]
    Alon Y. Levy, Divest Srivastava, and Thomas Kirk. Data model and query evaluation in global information systems. Journal of Intelligent Information Systems, 1995. Special Issue on Networked Information Discovery and Retrieval.Google Scholar
  15. [15]
    J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.Google Scholar
  16. [16]
    Anand Rajaraman, Yehoshua Sagiv, and Jeffrey D. Ullman. Answering queries using templates with binding patterns. In Proc. 14th ACM SIGACT-SIGMOD-GIGART Symposium on Principles of Database Systems, San Jose, CA, 1995.Google Scholar
  17. [17]
    Oded Shmueli. Decidability and expressiveness aspects of logic queries. In Proc. 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 237–249, 1987.Google Scholar
  18. [18]
    Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume I & II. Computer Science Press, 1989.Google Scholar
  19. [19]
    Jeffrey D. Ullman. Information integration using logical views. In Proceedings of the Sixth International Conference on Database Theory, pages 19–40. Springer-Verlag, 1997.Google Scholar
  20. [20]
    Jeffrey D. Ullman and Allen Van Gelder. Parallel complexity of logical query programs. In Proc. 27th IEEE Symp. on Foundations of Comp. Sci., pages 438–454, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Foto N. Afrati
    • 1
  • Manolis Gergatsoulis
    • 2
  • Theodoros Kavalieros
    • 1
  1. 1.Dept. of Electrical and Computer EngineeringNational Technical University of AthensAthensGreece
  2. 2.Inst. of Informatics & Telecom.N.C.S.R. ‘Demokritos’A. Paraskevi AttikisGreece

Personalised recommendations