Skip to main content
SpringerLink
Log in

Answering Queries Using Materialized Views with Disjunctions

  • Conference paper
  • First Online:
Book cover 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

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.

This work has been partially supported by the Greek General Secretariat of Research and Technology under the project “Logic Programming Systems and Environments for developing Logic Programs” of ΠENEΔ′95, contract no 952.

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. 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. 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. F. Afrati, S. Cosmadakis, and M. Yannakakis. On datalog vs. polynomial time. J. Computer and Systems Sciences, 51(2):117–196, 1995.

    MathSciNet  Google Scholar 

  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. 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. Oliver M. Duschka. Query Planning and Optimization in Information Integration. PhD thesis, Stanford University, December 1997.

    Google Scholar 

  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. 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. M. Gergatsoulis. Correctness-preserving transformations for disjunctive logic programs. Demo 97/2, Institute of Informatics & Telecom. NCSR ‘Demokritos’, 1997.

    Google Scholar 

  10. Manolis Gergatsoulis. Unfold/fold transformations for disjunctive logic programs. Information Processing Letters, 62(1):23–29, April 1997.

    Article  MathSciNet  Google Scholar 

  11. M. A. Harrison. Introduction to formal language theory. Addison-Wesley, 1978.

    Google Scholar 

  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. 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. 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. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.

    Google Scholar 

  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. 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. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume I & II. Computer Science Press, 1989.

    Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical and Computer Engineering, National Technical University of Athens, 157 73, Athens, Greece

    Foto N. Afrati & Theodoros Kavalieros

  2. Inst. of Informatics & Telecom., N.C.S.R. ‘Demokritos’, 153 10, A. Paraskevi Attikis, Greece

    Manolis Gergatsoulis

Authors
  1. Foto N. Afrati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manolis Gergatsoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Theodoros Kavalieros
    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

Afrati, F.N., Gergatsoulis, M., Kavalieros, T. (1999). Answering Queries Using Materialized Views with Disjunctions. 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_27

Download citation

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

  • 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