An incremental maintenance scheme of data cubes

  • Authors:
  • Dong Jin;Tatsuo Tsuji;Takayuki Tsuchida;Ken Higuchi

  • Affiliations:
  • Graduate School of Engineering, University of Fukui, Fukui-shi, Japan;Graduate School of Engineering, University of Fukui, Fukui-shi, Japan;Graduate School of Engineering, University of Fukui, Fukui-shi, Japan;Graduate School of Engineering, University of Fukui, Fukui-shi, Japan

  • Venue:
  • DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data cube construction is a commonly used operation in data warehouses. Because of the volume of data stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, incremental maintenance of data cube is really effective. To maintain a data cube incrementally, previous methods were mainly for relational databases. In this paper, we employ an extendible multidimensional array model to maintain data cubes. 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. Our data cube scheme and related maintenance methods are presented in this paper, and cost analysis on our approach is shown and compared with existing methods.