Abstract
We have proposed an incremental maintenance scheme of data cubes employing extendible multidimensional array model. 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. But in practice, most multidimensional arrays for data cube are large but sparse. In this paper, we describe a data compression scheme for our proposed cube maintenance method, and demonstrate the physical refreshing algorithm working on the data structure thus compressed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jin, D., Tsuji, T., Tsuchida, M., Higuchi, K.: An Incremental Maintenance Scheme of Data Cubes. In: Haritsa, et al.(eds.) DASFAA 2008. LNCS, vol. 4947, pp. 580–587, Springer, Heidelberg (to appear, 2008)
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)
Lee, K.Y., Kim, M.H.: Efficient Incremental Maintenance of Data Cubes. In: Proc. of VLDB, pp. 823–833 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsuji, T., Jin, D., Higuchi, K. (2008). Data Compression for Incremental Data Cube Maintenance. 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_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-78568-2_62
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)