Clustering Based Compress Data Cube Algorithm

In this paper, we present a novel clustering based technique to build an approximate compressed data cube and using this compressed data cube to provide answers to queries directly. Results of experiments on the effectiveness of Compact Cube are presented, using both synthetic and real-world data. T...

Full description

Saved in:
Bibliographic Details
Published inWorld Congress on Software Engineering Vol. 4; pp. 429 - 433
Main Authors Zhijun Xie, Mingxing Nie, Tongsen Wang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2009
Subjects
Aggregates
Clustering algorithms
Costs
Distribution functions
Frequency estimation
Probability density function
Relational databases
Software algorithms
Software engineering
Statistics
Online AccessGet full text
ISBN0769535704
9780769535708
DOI10.1109/WCSE.2009.330

Cover

More Information
Summary:In this paper, we present a novel clustering based technique to build an approximate compressed data cube and using this compressed data cube to provide answers to queries directly. Results of experiments on the effectiveness of Compact Cube are presented, using both synthetic and real-world data. The results indicate that the proposed Compress Cube can efficiently reduce the cube size. Through comparing the algorithm with some other algorithms, we can conclude that the compact cube is more efficient than others.
ISBN:0769535704
9780769535708
DOI:10.1109/WCSE.2009.330