Welcome to the InfoSci Platform
Reference Hub4
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel

Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel

Ying Chen, Frank Dehne, Todd Eavis, A. Rau-Chaplin
Copyright: © 2006 |Volume: 2 |Issue: 1 |Pages: 26
ISSN: 1548-3924|EISSN: 1548-3932|ISSN: 1548-3924|EISBN13: 9781615202133|EISSN: 1548-3924|DOI: 10.4018/jdwm.2006010101
Cite Article Cite Article

MLA

Chen, Ying, et al. "Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel." IJDWM vol.2, no.1 2006: pp.1-26. http://doi.org/10.4018/jdwm.2006010101

APA

Chen, Y., Dehne, F., Eavis, T., & Rau-Chaplin, A. (2006). Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel. International Journal of Data Warehousing and Mining (IJDWM), 2(1), 1-26. http://doi.org/10.4018/jdwm.2006010101

Chicago

Chen, Ying, et al. "Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel," International Journal of Data Warehousing and Mining (IJDWM) 2, no.1: 1-26. http://doi.org/10.4018/jdwm.2006010101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

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.