[go: up one dir, main page]

Skip to main content

Supporting Hot Spots with Materialized Views

  • Conference paper
  • First Online:
Data Warehousing and Knowledge Discovery (DaWaK 2000)

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

Included in the following conference series:

  • 515 Accesses

Abstract

Since data warehousing has become a major field of research there has been a lot of interest in the selection of materialized views for query optimization. The problem is to find the set of materialized views which yields the highest cost savings for a given set of queries under a certain space constraint. The analytical perspective results in queries which on the one hand require aggregations but on the other hand are quite restrictive with regard to the fact data. Usually there are “hot spots”, i.e. regions which are requested very frequently, like the current period or the most important product group. However, most algorithms in literature do not consider restrictions of queries and therefore generate only views containing all summary data at a certain aggregation level although the space it occupies could better be used for other, more beneficial views. This article presents an algorithm for the selection of restricted views. The cost savings using this algorithm have been experimentally evaluated to be up to 80% by supplying only 5% additional space.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Albrecht, J.; Bauer, A.; Deyerling, O.; Günzel, H.; Hümmer, W.; Lehner, W.; Schlesinger, L.: Management of multidimensional Aggregates for efficient Online Analytical Processing, in: International Database Engineering and Applications Symposium (IDEAS’99, Montreal, Canada, August 1–3), 1999

    Google Scholar 

  2. Albrecht, J.; Günzel, H.; Lehner, W.: Set-Derivability of Multidimensional Aggregates, in: Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery (DaWaK’99, Florence, Italy, August 30–September 1), 1999

    Google Scholar 

  3. Baralis, E.; Paraboschi, S.; Teniente, E.: Materialized View Selection in a Multidimensional Database, in: Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB ‘97, Athens, Greece, August 25–27), 1997

    Google Scholar 

  4. Cohen, S.; Nutt, W.; Serebrenik, A.: Rewriting Aggregate Queries Using Views, in: Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’ 99, Philadelphia (PA), USA, May 31–June 2), 1999

    Google Scholar 

  5. Ezeife, C.I.; Baksh, S.: A Partition-Selection Scheme for Warehouse Views, in: Proceedings of the 9th International Conference on Computing and Information (ICCI’ 98, Winnipeg, Canada, June 17–20), 1998

    Google Scholar 

  6. Gupta, H.; Harinarayan, V.; Rajaraman, A.; Ullman, J.D.: Index Selection for OLAP, in: Proceedings of the 13th International Conference on Data Engineering (ICDE’ 97, Birmingham, U.K., April 7–11), 1997

    Google Scholar 

  7. Gupta, H.: Selection of Views to Materialize in a DataWarehouse, in: Proceedings of the 6th International Conference on Database Theory (ICDT’ 97, Delphi, Greece, January 8–10), 1997

    Google Scholar 

  8. Harinarayan, V.; Rajaraman, A.; Ullman, J.D.: Implementing Data Cubes Efficiently, in: Proceedings of the 25th International Conference on Management of Data, (SIGMOD’ 96, Montreal, Canada, June 4–6), 1996

    Google Scholar 

  9. Kimball, R.: The Data Warehouse Toolkit, 2nd Edition, John Wiley & Sons, Inc., New York, 1996

    Google Scholar 

  10. Srivastava, D.; Dar, S.; Jagadish, H.V.; Levy, A.Y.: Answering Queries with Aggregation Using Views, in: Proceedings of 22th International Conference on Very Large Data Bases (VLDB’96, Bombay, India, September 3–6), 1996

    Google Scholar 

  11. Shukla, A.; Deshpande, P.; Naughton, J.: Materialized View Selection for Multidimensional Datasets, in: Proceedings of the 24th International Conference on Very Large Databases (VLDB’ 98, New York (NY), USA, August 24–27), 1998

    Google Scholar 

  12. Yang, J.; Karlapalem, K.; Li, Q.: Algorithms for Materialized View Design in Data Warehousing Environment, in: Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB’ 97, Athens, Greece, August 25–29), 1997

    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

Albrecht, J., Bauer, A., Redert, M. (2000). Supporting Hot Spots with Materialized Views. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2000. Lecture Notes in Computer Science, vol 1874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44466-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44466-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44466-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics