Skip to main content

Designing Views to Efficiently Answer Real SQL Queries

  • Conference paper
Abstraction, Reformulation and Approximation (SARA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3607))

Abstract

The problem of optimizing queries in the presence of materialized views and the related view-design problem have recently attracted a lot of attention. Significant research results have been reported, and materialized views are increasingly used in query evaluation in commercial data-management systems. At the same time, most results in the literature assume set-theoretic semantics, whereas SQL queries have bag-theoretic semantics (duplicates are not eliminated unless explicitly requested). This paper presents results on selecting views to answer queries in relational databases under set, bag, and bag-set semantics. The results can be used under each of the three assumptions, to find sound and complete algorithms for designing views and rewriting queries efficiently.

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

Access this chapter

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. Afrati, F., Chirkova, R.: Selecting and using views to compute aggregate queries. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 383–397. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Afrati, F., Li, C., Ullman, J.D.: Generating efficient plans for queries using views. In: Proceedings of ACM SIGMOD (2001)

    Google Scholar 

  3. Agrawal, S., Chaudhuri, S., Narasayya, V.R.: Automated selection of materialized views and indexes in SQL databases. In: Proc. VLDB, pp. 496–505 (2000)

    Google Scholar 

  4. Baralis, E., Paraboschi, S., Teniente, E.: Materialized view selection in a multidimensional database. In: Proceedings of VLDB, pp. 156–165 (1997)

    Google Scholar 

  5. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational databases. In: Proc. 9th ACM STOC, pp. 77–90 (1977)

    Google Scholar 

  6. Chaudhuri, S., Krishnamurthy, R., Potamianos, S., Shim, K.: Optimizing queries with materialized views. In: Proceedings of ICDE, pp. 190–200 (1995)

    Google Scholar 

  7. Chaudhuri, S., Vardi, M.Y.: Optimization of real conjunctive queries. In: Proceedings of PODS, pp. 59–70. ACM Press, New York (1993)

    Google Scholar 

  8. Chirkova, R., Halevy, A.Y., Suciu, D.: A formal perspective on the view selection problem. The VLDB Journal 11(3), 216–237 (2002)

    Article  MATH  Google Scholar 

  9. Chirkova, R., Li, C.: Materializing views with minimal size to answer queries. In: Proceedings of PODS, pp. 38–48. ACM Press, New York (2003)

    Google Scholar 

  10. Deutsch, A.: XML Query Reformulation over Mixed and Redundant Storage. PhD thesis, University of Pennsylvania (2002)

    Google Scholar 

  11. Gribble, S., Halevy, A., Ives, Z., Rodrig, M., Suciu, D.: What can databases do for peer-to-peer? In: Proceedings of WebDB (2001)

    Google Scholar 

  12. Gupta, H.: Selection of views to materialize in a data warehouse. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 98–112. Springer, Heidelberg (1996)

    Google Scholar 

  13. Gupta, H., Harinarayan, V., Rajaraman, A., Ullman, J.D.: Index selection for OLAP. In: Proceedings of ICDE, pp. 208–219 (1997)

    Google Scholar 

  14. Gupta, H., Mumick, I.S.: Selection of views to materialize under a maintenance cost constraint. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 453–470. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: Proceedings of ACM SIGMOD, pp. 205–216 (1996)

    Google Scholar 

  16. Ioannidis, Y., Ramakrishnan, R.: Containment of conjunctive queries: Beyond relations as sets. ACM Transactions on Database Systems 20(3), 288–324 (1995)

    Article  Google Scholar 

  17. Karloff, H.J., Mihail, M.: On the complexity of the view-selection problem. In: Proceedings of PODS, Philadelphia, Pennsylvania, pp. 167–173 (1999)

    Google Scholar 

  18. Levy, A.Y., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: Proceedings of PODS, pp. 95–104. ACM Press, New York (1995)

    Google Scholar 

  19. Pottinger, R., Levy, A.Y.: A scalable algorithm for answering queries using views. In: Proceedings of VLDB, pp. 484–495 (2000)

    Google Scholar 

  20. Theodoratos, D., Sellis, T.: Data warehouse configuration. In: Proceedings of VLDB, Athens, Greece, pp. 126–135 (1997)

    Google Scholar 

  21. Yang, J., Karlapalem, K., Li, Q.: Algorithms for materialized view design in data warehousing environment. In: Proceedings of VLDB, pp. 136–145 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Afrati, F., Chirkova, R., Gergatsoulis, M., Pavlaki, V. (2005). Designing Views to Efficiently Answer Real SQL Queries. In: Zucker, JD., Saitta, L. (eds) Abstraction, Reformulation and Approximation. SARA 2005. Lecture Notes in Computer Science(), vol 3607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527862_26

Download citation

  • DOI: https://doi.org/10.1007/11527862_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27872-6

  • Online ISBN: 978-3-540-31882-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics