Abstract
Data warehouses typically store a multidimensional fact representation of the data that can be used in any type of analysis. Many applications materialize data cubes as multidimensional arrays for fast, direct and random access to values. Those data cubes are used for exploration, with operations such as roll-up, drill-down, slice and dice. The data cubes can become very large, increasing the amount of I/O significantly due to the need to retrieve a large number of cube chunks. The large cost associated with I/O leads to degraded performance. The data cube can be compressed, but traditional compression techniques do not render it queriable, as they compress and decompress reasonably large blocks and have large costs associated with the decompression and indirect access. For this reason they are mostly used for archiving. This paper uses the QuantiCubes compression strategy that replaces the data cube by a smaller representation while maintaining full queriability and random access to values. The results show that the technique produces large improvement in performance.
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
Furtado, Pedro Accurate Reduced Representations of Multidimensional Fact-Like Data Sets, PhD thesis, Universidade de Coimbra, 2000.
J-L Gaily and M. Adler. Zlib home page. http://quest.jpl.nasa.gov/zlib/.
J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 1990: ISBN 1-55860-069-8.
S.P. Lloyd. Least Squares Quantization in PCM. IEEE Transactions on Information Theory, IT-28:127–135, March, 1982.
M. Nelson, J-L Gaily, The Data Compression Book, 2nd edition, 1996-M&T Books, ISBN 1-55851-434-1.
S. Sarawagi and M. Stonebraker, “Efficient Organization of Large Multidimensional Arrays”, in Proceedings of the 11th Annual IEEE Conference on Data Engineering (ICDE’94), Houston, Texas, 1994.
Welsh, Terry, “A Technique for High-Performance Data Compression” IEEE Computer, Volume 17, Nℴ 6, June 1984, pages 8–19.
J. Ziv, Lempel, “A Universal algorithm for sequential data compression”, IEEE Transactions on Information Theory, Volume 23, Nℴ 3, May 1977, pages 337–343.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furtadoand, P., Madeira, H. (2000). Data Cube Compression with QuantiCubes. 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_16
Download citation
DOI: https://doi.org/10.1007/3-540-44466-1_16
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