Frank Dehne, Todd Eavis, Susanne Hambrusch, Andrew Rau-Chaplin  Home/Search
Context Related
| 134.117.206.249:8000/www/pu...paper.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 134.117.206.249:8000/www/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a general methodology for the efficient parallelization of existing data cubeconstruction 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 suchaway 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... (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
12.3%: Parallelizing The Data Cube - Frank Dehne Todd (2002) (Correct)
11.0%: Coarse Grained Parallel On-Line Analytical Processing.. - Dehne, Eavis.. (2001) (Correct)
10.2%: Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Rau-Chaplin (2002) (Correct)
Active bibliography (related documents): More All
0.3: A Data Warehouse Multidimensional Data Models Classification - Abelló, Samos, Saltor (Correct)
0.2: Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
0.2: The cgmCUBE Project: Optimizing Parallel Data Cube.. - Dehne, Eavis, al. (Correct)
Similar documents based on text: More All
0.8: Parallel Multi-Dimensional ROLAP Indexing - Dehne, Eavis, Rau-Chaplin (2003) (Correct)
0.7: A Cluster Architecture for Parallel Data Warehousing - Dehne, Eavis, Rau-Chaplin (2001) (Correct)
0.7: Computing Partial Data Cubes for Parallel Data.. - Dehne, Eavis.. (2001) (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/article/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/article/dehne02parallelizing.html" }
Citations (may not include all citations):393 Data cube: A relational aggregation operator generalizing gr.. - Gray, Chaudhuri et al. - 1997
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
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 Towards efficiency and portability: Programming with the BSP.. - Goudreau, Lang et al. - 1996
50 External memory algorithms (context) - Vitter - 1998
36 Efficient external memory algorithms bysimulating coarse-gra.. - Dehne, Dittrich et al. - 1997
32 High performance OLAP and data mining on parallel computers - Goil, Choudhary - 1997
31 Algorithms for parallel memory (context) - Vitter, Shriver - 1994
31 efficientscientific computation using tpie (context) - Vengroff, Vitter et al. - 1996
30 Bulk synchronous parallel computing - A paradigm for transpo.. - Cheatham, Fahmy et al. - 1995
30 BSP-like external-memory computation - Sibeyn, Kaufmann - 1997
27 Optimal algorithms for tree partitioning (context) - Frederickson - 1991
27 IBM Almaden ResearchCenter (context) - Sarawagi, Agrawal et al. - 1996
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
14 A parallel scalable infrastructure for OLAP and data mining - Goil, Choudhary - 1999
13 Parallel virtual memory - Dehne, Dittrich et al. - 1999
13 complexityby simulating coarse grained parallel algorithms (context) - Dehne, Hutchinson et al. - 1999
10 Probablistic counting algorithms for database applications (context) - Flajolet, Martin - 1985
10 Storage estimation for mutlidimensional aggregates in the pr.. (context) - Shukla, Deshpende et al. - 1996
6 Efficient implementation of a shifting algorithm (context) - Perl, Vishkin - 1985
3 ACM Special Interest Group on Management of Data (context) - Harinarayan, Rajaraman et al. - 1996
Documents on the same site (http://134.117.206.249:8000/www/publications/index.htm): More
Parallelizing the Data Cube - Dehne, Eavis, Hambrusch, Rau-Chaplin (2002) (Correct)
Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (Correct)
Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (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