[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Computing
An Incremental Maintenance Scheme of Data Cubes and Its Evaluation
Dong JinTatsuo TsujiKen Higuchi
Author information
JOURNAL FREE ACCESS

2009 Volume 4 Issue 2 Pages 364-376

Details
Abstract

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.

Content from these authors
© 2009 by Information Processing Society of Japan
Previous article Next article
feedback
Top