Conference Paper

A New Bitmap Index and a New Data Cube Compression Technology

DOI: 10.1007/978-3-540-69848-7_97 Conference: Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30 - July 3, 2008, Proceedings, Part II
Source: DBLP


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.

4 Reads
This research doesn't cite any other publications.