Data compression for incremental data cube maintenance

Authors:
Tatsuo Tsuji;Dong Jin;Ken Higuchi
Affiliations:
Graduate School of Engineering, University of Fukui;Graduate School of Engineering, University of Fukui;Graduate School of Engineering, University of Fukui
Venue:
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Year:
2008

Citing 3
Cited 0

Efficient incremental maintenance of data cubes

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
An incremental maintenance scheme of data cubes

DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
An extendible array based implementation of relational tables for multi dimensional databases

DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

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.