Welcome to the InfoSci Platform
A New Parallel Data Cube Construction Scheme

A New Parallel Data Cube Construction Scheme

Dong Jin, Tatsuo Tsuji
Copyright: © 2012 |Volume: 4 |Issue: 2 |Pages: 14
ISSN: 1938-0259|EISSN: 1938-0267|EISBN13: 9781466612327|DOI: 10.4018/jghpc.2012040103
Cite Article Cite Article

MLA

Jin, Dong, and Tatsuo Tsuji. "A New Parallel Data Cube Construction Scheme." IJGHPC vol.4, no.2 2012: pp.32-45. http://doi.org/10.4018/jghpc.2012040103

APA

Jin, D. & Tsuji, T. (2012). A New Parallel Data Cube Construction Scheme. International Journal of Grid and High Performance Computing (IJGHPC), 4(2), 32-45. http://doi.org/10.4018/jghpc.2012040103

Chicago

Jin, Dong, and Tatsuo Tsuji. "A New Parallel Data Cube Construction Scheme," International Journal of Grid and High Performance Computing (IJGHPC) 4, no.2: 32-45. http://doi.org/10.4018/jghpc.2012040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The pre-computation of data cubes is critical for improving the response time of OLAP (On-Line Analytical Processing) systems. To meet the need for improved performance created by growing data sizes, parallel solutions for data cube construction are becoming increasingly important. This paper presents a new parallel data cube construction scheme based on an extendible multidimensional array, which is dynamically extendible along any dimension without relocating any existing data. The authors have implemented and evaluated their parallel data cube construction methods on shared-memory multiprocessors. Given the performance limit, the methods achieve close to linear speedup with load balance. The authors’ experiments also indicate that their parallel methods can be more scalable on higher dimensional data cube construction.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.