A cluster architecture for parallel data warehousing

Proceedings - 1st IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2001

Volumn , Issue , 2001, Pages 161-168

  Dehne, Frank ^a   Eavis, Todd ^b   Rau Chaplin, Andrew ^b  

^a CARLETON UNIVERSITY   (Canada)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ARCHITECTURE; CLUSTER-BASED IMPLEMENTATIONS; DATABASE OPERATORS; PARALLEL PERFORMANCE; PARALLELIZATION TECHNIQUES; RESEARCH EFFORTS; SEQUENTIAL ALGORITHM; TEST CONDITION;

DATA WAREHOUSES; SEQUENTIAL SWITCHING;

CLUSTER COMPUTING;

EID: 33645481486     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2001.923189     Document Type: Conference Paper

References (18)

1. S. Agarwal, R. Agrawal, P. Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. Proceedings of the 22nd International VLDB Conference, pages 506-521, 1996.
2. R. Becker, S. Schach, and Y. Perl. A shifting algorithm for min-max tree partitioning. Journal of the ACM, 29:58-67, 1982.
3. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. Proceedings of the 1999 ACM SIGMOD Conference, pages 359-370, 1999.
4. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1996.
5. F. Dehne, T. Eavis, S. Hambrusch, and A. Rau-Chaplin. Parallelizing the datacube. International Conference on Database Theory, 2001.
6. P. Flajolet and G. Martin. Probabilistic counting algorithms for database applications. Journal of Computer and System Sciences, 31(2): 182-209, 1985.
7. S. Goil and A. Choudhary. High performance olap and data mining on parallel computers. Journal of Data Mining and Knowledge Discovery, 1(4), 1997.
8. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Proceeding of the 12th International Conference On Data Engineering, pages 152-159, 1996.
9. A. Guttman. R-trees: A dynamic index structure for spatial searching. Proceedings of the 1984 ACM SIGMOD Conference, pages 47-57, 1984.
10. V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing data cubes. Proceedings of the 1996 ACM SIGMOD Conference, pages 205-216, 1996.
11. I. Kamel and C. Faloutsos. On packing r-trees. Proceedings of the Second International Conference on Information and Knowledge Management, pages 490-499, 1993.
12. Leda. http://www. mpi-sb. mpg. de/LEDA/.
13. K. Ross and D. Srivastava. Fast computation of sparse data cubes. Proceedings of the 23rd VLDB Conference, pages 116-125, 1997.
14. N. Roussopolis and D. Leifker. Direct spatial search on pictorial databases using packed r-trees. Proceedings of the 1985 ACM SIGMOD Conference, pages 17-31, 1985.
15. N. Roussopoulos, Y. Kotidis, and M. Roussopolis. Cube-tree: Organization of the bulk incremental updates on the data cube. Proceedings of the 1997 ACM SIGMOD Conference, pages 89-99, 1997.
16. S. Sarawagi, R. Agrawal, and A. Gupta. On computing the data cube. Technical Report RJ10026, IBM Almaden Research Center, San Jose, California, 1996.
17. A. Shukla, P. Deshpande, J. Naughton, and K. Ramasamy. Storage estimation for multidimensional aggregates in the presence of hierarchies. Proceedings of the 22nd VLDB Conference, pages 522-531, 1996.
18. Y. Zhao, P. Deshpande, and J. Naughton. An array-based algorithm for simultaneous multi-dimensional aggregates. Proceedings of the 1997 ACM SIGMOD Conference, pages 159-170, 1997.