Skip to main content

Materialized View Selection in a Data Warehouse

  • Conference paper
  • First Online:

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

Abstract

Selecting views to be materialized is one of the most important decisions in designing a warehouse. In this paper we present algorithms for how to select a set of views to be materialized so as to achieve both good query performance and low view maintain cost under a storage space constraint. We generated the candidate views based on Query Frames which represent the essential characters of queries. We give an algorithm to select an optimal set of views to be materialized first and then give a feasible algorithm which generates a reasonable solution.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In ACM SIGMOD,Canada, June 1996

    Google Scholar 

  2. E. Baralis, S. Paraboschi, E. Teniente. Materialized View Selection in a Multidimensional Database. In Proc. VLDB, 1997

    Google Scholar 

  3. A. Shukla, P. Deshpande, J.F. Naughton. Materialized View Selection for Multidimensional Datasets. In Proc. VLDB, 1998

    Google Scholar 

  4. H. Gupta, V. Harinarayan, A. Rajaraman, and J. D. Ullman. Index Selection for OLAP. In Proc. ICDE, 1997

    Google Scholar 

  5. D. Theodoratos, T. Sellis. Data Warehouse Configuration. In Proc. VLDB, 1997

    Google Scholar 

  6. K.A. Ross, D. Srivastava and S. Sudarshan Materialized view maintenance and integrity constraint checking: trading space for time. In ACM SIGMOD, 1996

    Google Scholar 

  7. H. Gupta. Selection of Views In a DataWarehouse. In Proc. ICDT, 1997

    Google Scholar 

  8. J. Yang, K. Karlapalem, Q. Li. Algorithms for Materialized View Design in Data Warehousing Environment. In Proc. VLDB, 1997

    Google Scholar 

  9. U. Dayal, Of Nests and Trees:A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers. In Proc.VLDB, 1987

    Google Scholar 

  10. M. Muralikrishna, Improved Unnesting Algorithms for Join Aggregate SQL Queries. In Proc. VLDB, 1992

    Google Scholar 

  11. Y. Feng, X.Y. Du, S. Wang, Materialized View Selection in a Data Warehouse., Renmin University of China, Research Report, 1999

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, F., Xiaoyong, D., Shan, W. (2000). Materialized View Selection in a Data Warehouse. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45151-X_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics