Abstract
This paper introduces a new kind of bitmap index. A tuple in the data cube is mapped to a sequential key (seqkey) determined by its value in each dimension. Furthermore, the quotient bit sequence is constructed according to whether the corresponding cell of a seqkey exists in the cover quotient cube or not, and the cover quotient cube is indexed by this quotient bit sequence (qcbit index). A compression method is presented for the seqkey cover quotient cube, which compress the cover quotient cube via omitting dimension attributes for all cells. To improve the storage and query of data cubes, based on these index and compression methods, algorithms are proposed to query the cover quotient cube and seqkey cover quotient cube. Experimental results on the dataset weather show that the volume of the qcbit index file is only 11% of the value-list index file, and the volume of seqkey cover quotient cube is only 27.75% of the original cover quotient cube.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data Cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. J. Data Mining and Knowledge Discovery 1(1), 29–53 (1997)
Lakshmanan, L.V., Pei, J., Han, J.W.: Quotient cube: how to summarize the semantics of a data cube. In: Proceedings of the 28th international Conference on Very Large Data Bases, pp. 778–789. Very Large Data Bases. VLDB Endowment (2002)
Lakshmanan, L.V., Pei, J., Zhao, Y.: QC-trees: an efficient summary structure for semantic OLAP. In: Proceedings of the 2003 ACM SIGMOD international Conference on Management of Data, pp. 64–75. ACM, New York (2003)
Zhao, Y.: Quotient Cube and QC-Tree: Efficient Summarizations for Semantic OLAP, The University of British Columbia, Thesis for Master of Science (2003)
Li, S.E., Wang, S.: Research on closed data cube technology. J. Journal of Software 15(8), 1165–1171 (2004)
Li, C.P., Cong, G., Tung, A.K., Wang, S.: Incremental maintenance of quotient cube for median. In: Proceedings of the Tenth ACM SIGKDD international Conference on Knowledge Discovery and Data Mining, pp. 226–235. ACM, New York (2004)
Li, H.S., Huang, H.K.: Online Aggregation on Data Cubes Without Auxiliary Information. J. Journal of Software 17(4), 806–813 (2006)
Hahn, C., et al.: Edited synoptic cloud reports from ships and land stations over the globe, 1982-1991, http://cdiac.ornl.gov/ftp/ndp026b/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xi, J., Chen, F., Zhang, P. (2008). A New Bitmap Index and a New Data Cube Compression Technology. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_97
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)