Skip to main content

A New Incremental Maintenance Algorithm of Data Cube

  • Conference paper
  • First Online:
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2003)

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

  • 517 Accesses

Abstract

A well-known challenge in data warehousing is the efficient incremental maintenance of data cube in the presence of source data updates. In this paper, we present a new incremental maintenance algorithm developed from Mumick’s algorithm. Instead of using one auxiliary delta table, We use two to improve efficiency of data update. Moreover, when a materialized view has to be recomputed, we use its smallest ancestral view’s data, while Mumick uses the fact table which is usually much lager than its smallest ancestor. We have implemented this algorithm and found the performance has a significant improvement.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Agarwal, R. Agrawal, P. Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. In Vijayaraman et al. [TMB96], pages 506–521.

    Google Scholar 

  2. L. Colby, T. Griffin, L. Libkin, I. Mumick, and H. Trickey. Algorithms for deferred view maintenance. In Proc. of SIGMOD’97, pages 469–80, 1997.

    Google Scholar 

  3. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In Proc. 12th ICDE, pages 152–159, New Orleans, March 1996.

    Google Scholar 

  4. A. Gupta, I. Mumick: Maintenance of Materialized Views: Problems, Techniques, and Applications. In: IEEE Data Engineering Bulletin, 18(2), 1995

    Google Scholar 

  5. W. Labio, J. Yang, Y. Cui, H. Garcia-Molina, and J. Widom, 1999. Performance issues in incremental warehouse maintenance. Technical report (Oct.), Stanford University Database Group.

    Google Scholar 

  6. I. Mumick; D. Quass; B. Mumick: Maintenance of Data Cubes and Summary Tables in a Warehouse. In: Proc. of the ACM Int. Conf. on Management of Data, 1997

    Google Scholar 

  7. J. Yang and J. Widom. Incremental computation and maintenance of temporal aggregates. In Proceedings of the 17th International Conference on Data Engineering, pages 51–60, Heidelberg, Germany, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, H., Huang, H., Lin, Y. (2003). A New Incremental Maintenance Algorithm of Data Cube. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2003. Lecture Notes in Computer Science(), vol 2639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39205-X_84

Download citation

  • DOI: https://doi.org/10.1007/3-540-39205-X_84

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14040-5

  • Online ISBN: 978-3-540-39205-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics