Skip to main content

Hierarchical Data Cube for Range Queries and Dynamic Updates

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2003)

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

Abstract

A range query is a very popular and important operation on data cube in data warehouses. It performs an aggregation operation (e.g., SUM) over all selected cells of an OLAP data cube where the selection is specified by providing ranges of values for dimensions. Several techniques for range sum queries on data cubes have been introduced recently. However, they can incur update costs in the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, updating the entire data cube can be very costly and not realistic. To solve this problem, an effective hierarchical data cube (HDC for short) is provided in this paper. The analytical and experimental results show that HDC is superior to other cubage storage structures for both dynamic updates and range queries.

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. Codd, E.F.: Providing OLAP(on-line analytical processing) to user-analysts: An IT mandate, Technical report, E. F. Codd and Associates (1993)

    Google Scholar 

  2. Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Data cube: A relational aggregation operator generating group-by, cross-tab and sub-total. In: Proc. Of the 12th ICDE Conf., pp. 152–159 (1996)

    Google Scholar 

  3. Ho, C.T., Agrawal, R., Megiddo, R., Srikant, R.: Range Queries in OLAP Data Cubes. In: Proceedings of the Intl. ACM SIGMOD Confference, pp. 73–88 (1997)

    Google Scholar 

  4. Geffner, S., Agrawal, D., Abbadi, A., Smith, T.: Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes. In: Proceedings of the 15th Intl. Conference on Data Engineering, pp. 328–335 (1999)

    Google Scholar 

  5. Chan, C.Y., Ioannidis, Y.E.: Hierarchical Cubes for Range-Sum Queries. In: Proceedings of the 25th VLDB Conference, pp. 675–686 (1999)

    Google Scholar 

  6. Lee, S.Y., Ling, T.W., Li, H.G.: Hierarchical compact cube for range-max queries. In: Proc. Of the 26th VLDB Conf., pp. 232–241 (2000)

    Google Scholar 

  7. Li, H.G., Ling, T.W., Lee, S.Y., Loh, Z.X.: Range sum queries in dynamic OLAP data cubes. In: 3th International Symposium on Cooperative Database Systems for Advanced Applications(CODAS 2001), pp. 74–81 (2001)

    Google Scholar 

  8. Chun, S.J., Chung, C.W., Lee, J.H., Lee, S.L.: Dynamic update cube for range-sum queries. In: Proc. of 27th VLDB Conf., pp. 521–530 (2001)

    Google Scholar 

  9. Geffner, S., Agrawal, D.P., El Abbadi, A.: 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 

  10. Liang, W., Wang, H., Orlowska, M.E.: Range queries in dynamic OLAP data cubes. Data and Knowledge Engineering 34, 21–38 (2000)

    Article  MATH  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, J., Gao, H. (2003). Hierarchical Data Cube for Range Queries and Dynamic Updates. In: Kalinichenko, L., Manthey, R., Thalheim, B., Wloka, U. (eds) Advances in Databases and Information Systems. ADBIS 2003. Lecture Notes in Computer Science, vol 2798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39403-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39403-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics