Paper Info
Title
Data compression for incremental data cube maintenance
Abstract
We have proposed an incremental maintenance scheme of data cubes employing extendible multidimensional array model. Such an array enables incremental cube maintenance without relocating any data dumped at an earlier time, while computing the data cube efficiently by utilizing the fast random accessing capability of arrays. But in practice, most multidimensional arrays for data cube are large but sparse. In this paper, we describe a data compression scheme for our proposed cube maintenance method, and demonstrate the physical refreshing algorithm working on the data structure thus compressed.
Year
DOI
Venue
2008
10.1007/978-3-540-78568-2_62
DASFAA
Keywords
Field
DocType
multidimensional array,incremental maintenance scheme,extendible multidimensional array model,proposed cube maintenance method,incremental cube maintenance,incremental data cube maintenance,earlier time,fast random accessing capability,data cube,data structure,data compression scheme,data compression,random access
Data structure,Data mining,Computer science,Parallel computing,Incremental maintenance,Data compression,Database,Data cube,Cube
Conference
Volume
ISSN
ISBN
4947
0302-9743
3-540-78567-1
Citations 
PageRank 
References 
0
0.34
4
Authors
3
Name
Order
Citations
PageRank
Tatsuo Tsuji19719.50
Dong Jin28410.13
Ken Higuchi3769.83