An Incremental Maintenance Scheme of Data Cubes and Its Evaluation
スポンサーリンク
概要
- 論文の詳細を見る
Data cube construction is a commonly used operation in data warehouses. Since both the volume of data stored and analyzed in a data warehouse and the amount of computation involved in data cube construction are very large, incremental maintenance of data cube is really effective. 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. In this paper, we first present our data cube scheme and related maintenance methods, and then present the corresponding physical implementation scheme. We developed a prototype system based on the physical implementation scheme and performed evaluation experiments based on the prototype system.
著者
-
Tsuji Tatsuo
Graduate School of Engineering, University of Fukui
-
Higuchi Ken
Graduate School of Engineering, University of Fukui
-
Jin Dong
Graduate School Department Of Mechanical Engineering Hanyang University
関連論文
- A Labeling Scheme for Dynamic XML Trees Based on History-offset Encoding
- A Labeling Scheme for Dynamic XML Trees Based on History-offset Encoding
- Comparisons of Two Viscous Models for Vortex Methods in Parallel Computation(CFD)
- An Incremental Maintenance Scheme of Data Cubes and Its Evaluation