The Algorithm of Reducing Data Cube Size Rapidly

Efforts have been devoted to address the problem of how to reduce the size of a data cube through exploiting the relation of the cube tuples recently. In this paper, we present a novel technique to reduce data cube size by dividing the cube into chunk and using this reduced data cube to provide answers to queries directly. The experiments use both synthetic and real-world data. The results indicate that the technique can efficiently reduce the cube size. Through comparing the algorithm with some other algorithms, we can conclude that the technique of reducing size of cube is more efficient than others.