Parallelizing the Data Cube.

Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin: Parallelizing the Data Cube. ICDT 2001: 129-143
  author    = {Frank K. H. A. Dehne and
               Todd Eavis and
               Susanne E. Hambrusch and
               Andrew Rau-Chaplin},
  editor    = {Jan Van den Bussche and
               Victor Vianu},
  title     = {Parallelizing the Data Cube},
  booktitle = {Database Theory - ICDT 2001, 8th International Conference, London,
               UK, January 4-6, 2001, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1973},
  year      = {2001},
  isbn      = {3-540-41456-8},
  pages     = {129-143},
  ee        = {db/conf/icdt/DehneHR01.html,},
  crossref  = {DBLP:conf/icdt/2001},
  bibsource = {DBLP,}

Online Edition: Springer LINK

Citation Page BibTeX


Sameet Agarwal, Rakesh Agrawal, Prasad Deshpande, Ashish Gupta, Jeffrey F. Naughton, Raghu Ramakrishnan, Sunita Sarawagi: On the Computation of Multidimensional Aggregates. VLDB 1996: 506-521 BibTeX
Ronald I. Becker, Stephen R. Schach, Yehoshua Perl: A Shifting Algorithm for Min-Max Tree Partitioning. J. ACM 29(1): 58-67(1982) BibTeX
Kevin S. Beyer, Raghu Ramakrishnan: Bottom-Up Computation of Sparse and Iceberg CUBEs. SIGMOD Conference 1999: 359-370 BibTeX
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson: Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms. SPAA 1997: 106-115 BibTeX
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Parallel Virtual Memory. SODA 1999: 889-890 BibTeX
Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin: Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. Symposium on Computational Geometry 1993: 298-307 BibTeX
Philippe Flajolet, G. Nigel Martin: Probabilistic Counting Algorithms for Data Base Applications. J. Comput. Syst. Sci. 31(2): 182-209(1985) BibTeX
Greg N. Frederickson: Optimal Algorithms for Tree Partitioning. SODA 1991: 168-177 BibTeX
Sanjay Goil, Alok N. Choudhary: High Performance OLAP and Data Mining on Parallel Computers. Data Min. Knowl. Discov. 1(4): 391-417(1997) BibTeX
Sanjay Goil, Alok N. Choudhary: A Parallel Scalable Infrastructure for OLAP and Data Mining. IDEAS 1999: 178-186 BibTeX
Mark W. Goudreau, Kevin Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas: Towards Efficiency and Portability: Programming with the BSP Model. SPAA 1996: 1-12 BibTeX
Jim Gray, Surajit Chaudhuri, Adam Bosworth, Andrew Layman, Don Reichart, Murali Venkatrao, Frank Pellow, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals. Data Min. Knowl. Discov. 1(1): 29-53(1997) BibTeX
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Implementing Data Cubes Efficiently. SIGMOD Conference 1996: 205-216 BibTeX
Kenneth A. Ross, Divesh Srivastava: Fast Computation of Sparse Datacubes. VLDB 1997: 116-125 BibTeX
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton, Karthikeyan Ramasamy: Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies. VLDB 1996: 522-531 BibTeX
Jeffrey Scott Vitter: External Memory Algorithms. PODS 1998: 119-128 BibTeX
Jeffrey Scott Vitter, Elizabeth A. M. Shriver: Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica 12(2/3): 110-147(1994) BibTeX
Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton: An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. SIGMOD Conference 1997: 159-170 BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:19:16 2009