Sciweavers

118 search results - page 1 / 24
» Communication and Memory Optimal Parallel Data Cube Construc...
Sort
View
ICPP
2003
IEEE
13 years 9 months ago
Communication and Memory Optimal Parallel Data Cube Construction
Ruoming Jin, Ge Yang, Karthik Vaidyanathan, Gagan ...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 9 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
IPPS
2003
IEEE
13 years 9 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
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 tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
ICDE
2006
IEEE
215views Database» more  ICDE 2006»
14 years 5 months ago
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes
In this demo we present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporat...
Ying Chen, Andrew Rau-Chaplin, Frank K. H. A. Dehn...
SC
1995
ACM
13 years 8 months ago
Communication Optimizations for Parallel Computing Using Data Access Information
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
Martin C. Rinard