DocumentCode
2305194
Title
Clustering Based Compress Data Cube Algorithm
Author
Xie, Zhijun ; Nie, Mingxing ; Wang, Tongsen
Author_Institution
Dept. of Comput. & Inf., Fujian Univ. of Technol., Fuzhou, China
Volume
4
fYear
2009
fDate
19-21 May 2009
Firstpage
429
Lastpage
433
Abstract
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.
Keywords
data compression; pattern clustering; approximate compressed data cube; clustering based technique; compact cube; compress data cube algorithm; Aggregates; Clustering algorithms; Costs; Distribution functions; Frequency estimation; Probability density function; Relational databases; Software algorithms; Software engineering; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, 2009. WCSE '09. WRI World Congress on
Conference_Location
Xiamen
Print_ISBN
978-0-7695-3570-8
Type
conf
DOI
10.1109/WCSE.2009.330
Filename
5319589
Link To Document