Sciweavers

Share
JDWM
2006

Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel

8 years 10 months ago
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tasks in large data warehouses. However, as the size of data warehouses grows, the time it takes to perform this pre-computation becomes a significant performance bottleneck. 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. 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. We have implemented our new parallel shared-nothing data cube gener...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JDWM
Authors Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin
Comments (0)
books