CCBitmaps: A Space-Time Efficient Index Structure for OLAP

Authors:
Weiji Xiao;Jianqing Xi
Affiliations:
School of Computer Science & Engineering, South China University of Technology, Guangzhou 510000;School of Computer Science & Engineering, South China University of Technology, Guangzhou 510000
Venue:
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Year:
2009

Citing 4
Cited 0

Dwarf: shrinking the PetaCube

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
QC-trees: an efficient summary structure for semantic OLAP

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Condensed Cube: An Efficient Approach to Reducing Data Cube Size

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Quotient cube: how to summarize the semantics of a data cube

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quotient Cube is a classic algorithm to build data cube for OLAP. QC-Tree is based on Quotient Cube that can compress Cube further and accelerate query. This paper proposes a new index structure CC-Bitmap for OLAP which needs less storage space and improves queries performance significantly against QC-Trees, avoiding large memory and time consumption costs meanwhile. A new intersection algorithm CCListsIntersection is presented in this paper, which improves queries efficiency highly against traditional methods. Finally, detailed experiment evaluation is given to show that CC-Bitmap is a Space-Time efficient index structure for OLAP.