By Topic

Parallel Data Cube Construction Based on an Extendible Multidimensional Array

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dong Jin ; Coll. of Inf. Eng., Qingdao Univ., Qingdao, China ; Tsuji, T.

The pre-computation of data cubes is critical for improving the response time of OLAP(On-Line Analytical Processing) systems. In order 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 two parallel methods for data cube construction based on an extendible multidimensional array, which is dynamically extendible along any dimension without relocating any existing data. We have implemented and evaluated our core-based parallel data cube construction methods on shared-memory multiprocessors. Given the performance limit, the methods achieve close to linear speedup with load balance. Our experiments also indicate that our parallel methods can be more scalable on higher dimensional data cube construction.

Published in:

Trust, Security and Privacy in Computing and Communications (TrustCom), 2011 IEEE 10th International Conference on

Date of Conference:

16-18 Nov. 2011