Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel

Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel

Ying Chen (Dalhousie University, Canada), Frank Dehne (Carleton University, Canada), Todd Eavis (Concordia University, Canada) and A. Rau-Chaplin (Dalhousie University, Canada)
Copyright: © 2006 |Pages: 26
DOI: 10.4018/jdwm.2006010101
OnDemand PDF Download:
$37.50

Abstract

This paper presents an improved parallel method for generating ROLAP data cubes on a shared-nothing multiprocessor based on a novel optimized data partitioning technique. Since no shared disk is required, our method can be used for highly scalable processor clusters consisting of standard PCs with local disks only, connected via a data switch. Experiments show that our improved parallel method provides optimal, linear, speedup for at least 32 processors. The approach taken, which uses a ROLAP representation of the data cube, is well suited for large data warehouses and high dimensional data, and supports the generation of both fully materialized and partially materialized data cubes.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2017): Forthcoming, Available for Pre-Order
Volume 12: 4 Issues (2016): 2 Released, 2 Forthcoming
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing