Data compression for incremental data cube maintenance

被引:0
作者
Tsuji, Tatsuo [1 ]
Jin, Dong [1 ]
Higuchi, Ken [1 ]
机构
[1] Univ Fukui, Grad Sch Engn, Fukui, Japan
来源
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS | 2008年 / 4947卷
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:682 / 685
页数:4
相关论文
共 3 条
  • [1] Hasan KMA, 2005, LECT NOTES COMPUT SC, V3589, P233, DOI 10.1007/11546849_23
  • [2] JIN D, 2008, LNCS, V4947
  • [3] LEE KY, 2006, P VLDB C, P823