Skip to main content

An Incremental Maintenance Scheme of Data Cubes

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4947))

Abstract

Data cube construction is a commonly used operation in data warehouses. Because of the volume of data stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, incremental maintenance of data cube is really effective. To maintain a data cube incrementally, previous methods were mainly for relational databases. In this paper, we employ an extendible multidimensional array model to maintain data cubes. Such an array enables incremental cube maintenance without relocating any data dumped at an earlier time, while computing the data cube efficiently by utilizing the fast random accessing capability of arrays. Our data cube scheme and related maintenance methods are presented in this paper, and cost analysis on our approach is shown and compared with existing methods.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rosenberg, A.L.: Allocating Storage for Extendible Arrays. JACM 21, 652–670 (1974)

    Article  MATH  Google Scholar 

  2. Rosenberg, A.L., Stockmeyer, L.J.: Hashing Schemes for Extendible Arrays. JACM 24, 199–221 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  3. Hurtado, C.A., Mendelzon, A.O., Vaisman, A.A.: Maintaining Data Cubes under Dimension Updates. In: Proc. of the ICDE Conference, pp. 346–355 (1999)

    Google Scholar 

  4. Otoo, E.J., Merrett, T.H.: A Storage Scheme for Extendible Arrays. Computing 31, 1–9 (1983)

    Article  MATH  Google Scholar 

  5. Li, H., Huang, H., Lin, Y.: DSD: Maintain Data Cubes More Efficiently. Fundam. Inform. 59(2-3), 173–190 (2004)

    MATH  Google Scholar 

  6. Mumick, I.S., Quass, D., Mumick, B.S.: Maintenance of Data Cubes and Summary Tables in a Warehouse. In: Proc. of the ACM SIGMOD Conference, pp. 100–111 (1997)

    Google Scholar 

  7. Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. In: Proc. of the ICDE Conference, pp. 152–159 (1996)

    Google Scholar 

  8. Hasan, K.M.A., Kuroda, M., Azuma, N., Tsuji, T., Higuchi, K.: An Extendible Array Based Implementation of Relational Tables for Multidimensional Databases. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 233–242. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Lee, K.Y., Kim, M.H.: Efficient Incremental Maintenance of Data Cubes. In: Proc. of the VLDB Conference, pp. 823–833 (2006)

    Google Scholar 

  10. Riedewald, M., Agrawal, D., Abbadi, A.E.: Flexible Data Cubes for Online Aggregation. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 159–173. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Riedewald, M., Agrawal, D., Abbadi, A.E., Pajarola, R.: Space-Efficient Data Cubes for Dynamic Environments. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol. 1874, pp. 24–33. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Roussopoulos, N., Kotidis, Y., Roussopoulos, M.: Cubetree: Organization of and Bulk Incremental Updates on the Data Cube. In: Proc. of the ACM SIGMOD Conference, pp. 89–99 (1997)

    Google Scholar 

  13. Jin, R., Yang, G., Vaidyanathan, K., Agrawal, G.: Communication and Memory Optimal Parallel Data Cube Construction. IEEE Transactions On Parallel and Distributed Systems 16(12), 1105–1119 (2005)

    Article  Google Scholar 

  14. Agarwal, S., Agrawal, R., Deshpande, P.M., Gupta, A., Naughton, J.F., Ramakrishnan, R., Sarawagi, S.: On the Computation of Multidimensional Aggregates. In: Proc. of the VLDB Conference, pp. 506–521 (1996)

    Google Scholar 

  15. Geffner, S., Agrawal, D., Abbadi, A.E.: The Dynamic Data Cube. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 237–253. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Geffner, S., Riedewald, M., Agrawal, D., Abbadi, A.E.: Data Cubes in Dynamic Environments. IEEE Data Eng. Bull. 22(4), 31–40 (1999)

    Google Scholar 

  17. Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing Data Cubes Efficiently. In: Proc. of the ACM SIGMOD Conference, pp. 205–216 (1996)

    Google Scholar 

  18. Lehner, W., Sidle, R., Pirahesh, H., Cochrane, R.: Maintenance of Cube Automatic Summary Tables. In: Proc. of the ACM SIGMOD Conference, pp. 512–513 (2000)

    Google Scholar 

  19. Zhao, Y., Deshpande, P.M., Naughton, J.F.: An array based algorithm for simultaneous multidimensional aggregate. In: ACM SIGMOD, pp. 159–170 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jayant R. Haritsa Ramamohanarao Kotagiri Vikram Pudi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, D., Tsuji, T., Tsuchida, T., Higuchi, K. (2008). An Incremental Maintenance Scheme of Data Cubes. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds) Database Systems for Advanced Applications. DASFAA 2008. Lecture Notes in Computer Science, vol 4947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78568-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78568-2_15

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-78568-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics