Parallel ROLAP data cube construction on shared-nothing multiprocessors

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

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

^a DALHOUSIE UNIVERSITY   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA WAREHOUSES; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; GEOMETRY; INPUT OUTPUT PROGRAMS; MICROCOMPUTERS; MULTIPROCESSING SYSTEMS; PARALLEL PROCESSING SYSTEMS;

DATA DIMENSIONALITY; DATA MINING TASKS; GENERATION METHOD; ON-LINE ANALYTICAL PROCESSING; PARALLEL SOLUTIONS; RELATIONAL DATABASE; RELATIONAL TABLES; TIGHT INTEGRATIONS;

TREES (MATHEMATICS);

EID: 5444272547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213169     Document Type: Conference Paper

References (26)

1. S. Agarwal, R. Agarwal, P. Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, and S. Srawagi. On the computation of multi-dimensional aggregates. In Proc. 22nd VLDB Conf. , pages 506-521, 1996.
2. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In ACM SIGMOD Conference on Management of Data, pages 359-370, 1999.
3. F. Dehne, T. Eavis, S. Hambrusch, and A. Rau-Chaplin. Parallelizing the data cube. Distributed and Parallel Databases, 11(2):181-201, 2002.
4. F. Dehne, T. Eavis, and A. Rau-Chaplin. Computing partial data cubes. Technical report, http://www. cs. dal. ca/arc/publications/2-30/paper. pdf.
5. F. Dehne, T. Eavis, and A. Rau-Chaplin. A cluster architecture for parallel data warehousing. In Proc IEEE International Conference on Cluster Computing and the Grid (CCGrid 2001), Brisbane, Australia, 2001.
6. P. Flajolet and G. Martin. Probablistic 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):391-417, 1997.
8. S. Goil and A. Choudhary. A parallel scalable infrastructure for OLAP and data mining. In Proc. International Data Engineering and Applications Symposium (IDEAS'99), Montreal, 1999.
9. S. Goil and A. N. Choudhary. High performance multidimensional analysis of large datasets. In International Workshop on Data Warehousing and OLAP, pages 34-39, 1998.
10. J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, and M. Venkatrao. Data Cube: A relational aggregation operator generalizing group-by, cross-tab, and subtotals. J. Data Mining and Knowledge Discovery, 1(1):29-53, 1997.
11. J. Han, Y. Fu, W. Wang, J. Chiang, W. Gong, K. Koperski, D. Li, Y. Lu, A. Rajan, N. Stefanovic, B. Xia, and O. R. Zaiane. DBMiner: A system for mining knowledge in large relational databases. In Proc. 1996 Int'l Conf. on Data Mining and Knowledge Discovery (KDD'96), pages 250-255, Portland, Oregon, 1996.
12. V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing data cubes efficiently. ACM SIGMOD Record, 25(2):205-216, 1996.
13. M. P. Institute. LEDA. http://www. mpi-sb. mpg. de/LEDA/.
14. X. Li, P. Lu, J. Schaeffer, J. Shillington, P. S. Wong, and H. Shi. On the versatility of parallel sorting by regular sampling. Parallel Computing, 19(10):1079-1103, 1993.
15. H. Lu, X. Huang, and Z. Li. Computing data cubes using massively parallel processors. In Proc. 7th Parallel Computing Workshop (PCW'97), Canberra, Australia, 1997.
16. S. Muto and M. Kitsuregawa. A dynamic load balancing strategy for parallel datacube computation. In ACM Second International Workshop on Data Warehousing and OLAP (DOLAP 1999), pages 67-72, 1999.
17. S. Muto and M. Kitsuregawa. A dynamic load balancing strategy for parallel datacube computation. In Proceedings of the second ACM international workshop on Data warehousing and OLAP, pages 67-72. ACM Press, 1999.
18. R. Ng, A. Wagner, and Y. Yin. Iceberg-cube computation with pc clusters. In ACM SIGMOD Conference on Management of Data, pages 25-36, 2001.
19. K. Ross and D. Srivastava. Fast computation of sparse datacubes. In Proc. 23rd VLDB Conference, pages 116-125, 1997.
20. S. Sarawagi, R. Agrawal, and A. Gupta. On computing the data cube. Technical report rj10026, IBM Almaden Research Center, San Jose, CA, 1996.
21. A. Shukla, P. Deshpende, J. Naughton, and K. Ramasamy. Storage estimation for mutlidimensional aggregates in the presence of hierarchies. In Proc. 22nd VLDB Conference, pages 522-531, 1996.
22. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.
23. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.
24. J. Yu and H. Lu. Multi-cube computation. In Proc. 7th International Symposium on Database Systems for Advanced Applications, pages 126-133, Hong Kong, 2001.
25. Y. Zhao, P. Deshpande, and J. F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In Proc. ACM SIGMOD Conf. , pages 159-170, 1997.
26. G. Zipf. Human Behavior and The Principle of Least Effort. Addison-Wesley, 1949.