(Enter summary)
Abstract: This paper presents a general methodology for the efficient parallelization of existing data cube
construction algorithms. We describe two different partitioning strategies, one for top-down and one for bottomup
cube algorithms. Both partitioning strategies assign subcubes to individual processors in such a way that
the loads assigned to the processors are balanced. Our methods reduce inter processor communication overhead
by partitioning the load in advance instead of computing each individual ... (Update)
Cited by: More
Improved Data Partitioning for Building Large ROLAP Data.. - Chen, Dehne, Eavis, al.
(Correct)
The cgmCUBE project: Optimizing parallel data cube.. - Dehne, Eavis.. (2006)
(Correct)
Parallel ROLAP Data Cube Construction on Shared-Nothing.. - Chen, Dehne, Al. (2004)
(Correct)
Similar documents (at the sentence level): More
14.8%: Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Rau-Chaplin (2002)
(Correct)
13.2%: Coarse Grained Parallel On-Line Analytical Processing.. - Dehne, Eavis.. (2001)
(Correct)
10.6%: Coarse Grained Parallel On-Line Analytical Processing.. - Dehne, Eavis.. (2001)
(Correct)
Active bibliography (related documents): More All
0.3: The cgmCUBE Project: Optimizing Parallel Data Cube.. - Dehne, Eavis, al.
(Correct)
0.2: Developing Custom Firmware for the Red Storm - Seastar Network Interface
(Correct)
0.1: A Dynamic Load Balancing Strategy for Parallel Datacube.. - Muto, Kitsuregawa (1999)
(Correct)
Similar documents based on text:
2.0: Unknown -
(Correct)
Related documents from co-citation: More All
6: A dynamic load balancing strategy for parallel datacube computation
- Muto, Kitsuregawa - 1999
5: Computing data cubes using massively parallel processors
- Lu, Huang et al. - 1997
5: A parallel scalable infrastructure for OLAP and data mining
- Goil, Choudhary - 1999
BibTeX entry: (Update)
F. Dehne, T. Eavis, S. Hambrusch, and A. Rau-Chaplin, "Parallelizing the data cube," Distributed and Parallel Databases, vol. 11, no. 2, pp. 181--201, 2002. 236 CHEN ET AL. http://citeseer.ist.psu.edu/dehne02parallelizing.html More
@article{ dehne01parallelizing,
author = "Frank Dehne and Todd Eavis and Susanne Hambrusch and Andrew Rau-Chaplin",
title = "Parallelizing the Data Cube",
journal = "Lecture Notes in Computer Science",
volume = "1973",
pages = "129--??",
year = "2001",
url = "citeseer.ist.psu.edu/dehne02parallelizing.html" }
Citations (may not include all citations):
393
Data cube: A relational aggregation operator generalizing gr..
- Gray, Chaudhuri et al. - 1997
248
Implementing data cubes efficiently
- Harinarayan, Rajaraman et al. - 1996
185
the computation of multi-dimensional aggregates
- Agarwal, Agarwal et al. - 1996
109
An array-based algorithm for simultaneous multidimensional a..
- Zhao, Deshpande et al. - 1997
104
Algorithms for parallel memory. i: Two-level memories
- Vitter, Shriver - 1994
79
BSPlib: The BSP programming library
- Hill, McColl et al. - 1998
77
Bottom-up computation of sparse and iceberg cubes
- Beyer, Ramakrishnan - 1999
70
Fast computation of sparse datacubes
- Ross, Srivastava - 1997
64
Scalable parallel computational geometry for coarse grained ..
- Dehne, Fabri et al. - 1993
50
External memory algorithms (context) - Vitter - 1998
50
Towards efficiency and portability: Programming with the BSP..
- Goudreau, Lang et al. - 1996
36
Efficient external memory algorithms by simulating coarse-gr..
- Dehne, Dittrich et al. - 1997
32
High performance OLAP and data mining on parallel computers
- Goil, Choudhary - 1997
30
BSP-like external-memory computation
- Sibeyn, Kaufmann - 1997
30
Bulk synchronous parallel computing---A paradigm for transpo..
- Cheatham, Fahmy et al. - 1995
27
Optimal algorithms for tree partitioning (context) - Frederickson - 1991
21
Computation of multidimensional aggregates (context) - Deshpande, Agarwal et al. - 1996
20
A shifting algorithm for min-max tree partitioning (context) - Becker, Perl et al. - 1982
16
Iceberg-cube computation with pc clusters (context) - Ng, Wagner et al. - 2001
15
On computing the data cube (context) - Sarawagi, Agrawal et al. - 1996
14
A parallel scalable infrastructure for OLAP and data mining
- Goil, Choudhary - 1999
13
Parallel virtual memory
- Dehne, Dittrich et al. - 1999
10
Storage estimation for mutlidimensional aggregates in the pr.. (context) - Shukla, Deshpende et al. - 1996
10
The Benjamin/ Cummings Publishing Company (context) - Kumar, Grama et al. - 1994
10
Computing data cubes using massively parallel processors
- Lu, Huang et al. - 1997
10
Probablistic counting algorithms for database applications (context) - Flajolet, Martin - 1985
8
Multi-cube computation
- Yu, Lu - 2001
6
Efficient implementation of a shifting algorithm (context) - Perl, Vishkin - 1985
5
The Message Passing Interface (context) - Laboratory, www-unix et al. - 2001
4
o-efficient scientific computation using tpie
- Vengroff, Vitter - 1996
4
Reducing i/o complexity by simulating coarse grained paralle..
- Dehne, Hutchinson et al. - 1999
http://www.mpi-sb.mpg.de/LEDA/
Documents on the same site (http://www.dehne.carleton.ca/www/publications/index.htm): More
Parallel CLUSTAL W for PC Clusters - Cheetham, Dehne, Pitre.. (2003)
(Correct)
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999)
(Correct)
Determining Maximum k-Width-Connectivity on Meshes - Hambrusch, Dehne (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC