RCUBE: Parallel multi-dimensional ROLAP indexing

International Journal of Data Warehousing and Mining

Volumn 4, Issue 3, 2008, Pages 1-14

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

^a CARLETON UNIVERSITY   (Canada)

^b Civil and Environmental Engineering   (Canada)

^c DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Algorithmic complexity; Data warehousing and OLAP; Datacube; Efficiency; High performance computing; Parallel ROLAP indexing; Scalability issues; Scalability to large databases

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA WAREHOUSES; EFFICIENCY; PARALLEL PROCESSING SYSTEMS; SCALABILITY;

ALGORITHMIC COMPLEXITY; DATA CUBE; HIGH PERFORMANCE COMPUTING; LARGE DATABASE; SCALABILITY ISSUE;

INDEXING (OF INFORMATION);

EID: 47349086655     PISSN: 15483924     EISSN: 15483932     Source Type: Journal    
DOI: 10.4018/jdwm.2008070101     Document Type: Article

References (29)

1. Agrawal, S., Agrawal, R., Deshpande, P., Gupta, A.,Naughton, J., Ramakrishnan, R., & Sarawagi, S. (1996). On the computation of multidimensional aggregates. In Proceedings of the 22nd International VLDB Conference (pp. 506-521)..
2. Beyer, K., & Ramakrishnan, R. (1999). Bottom-up computation of sparse and iceberg cubes. In Proceedings of the 1999 ACM SIGMOD Conference (pp. 359-370).
3. Chen, Y, Dehne, F., Eavis, T., Green, D., Rau-Chaplin, A.,& Sithirasenan, E. (2006). CgmOLAP: Efficient parallel generation and querying of terabyte size ROLAP data cubes. In Proceedings of the 22nd International Conference on Data Engineering (ICDE) (p. 164). IEEE Comp. Soc. Dig. Library.
4. Chen, Y., Dehne, F., Eavis, T., & Rau-Chaplin, A. (2004). Parallel ROLAP data cube construction on shared-nothing multiprocessors. Distributed and Parallel Databases, 15, 219-236.
5. Chen, Y., Dehne, F., Eavis, T., & Rau-Chaplin, A. (2005). PnP: Parallel and external memory iceberg cube computation. In Proceedings ofthe 21 st International Conference on Data Engineering (ICDE) (pp. 576-577). IEEE Comp. Soc. Dig. Library.
6. Chen, Y., Dehne, F., Eavis, T., & Rau-Chaplin, A. (2006). Improved data partitioning for building large ROLAP data cubes in parallel. Journal of Data Warehousing and Mining, 2(1),1-26.
7. Dehne, F., Eavis, T., Hambrusch, S., & Rau-Chaplin, A. (2001). Parallelizing the datacube [Special issue on parallel and distributed data mining]. Distributed and Parallel Databases, 11(2), 181-201.
8. Dehne, F., Eavis, T., & Rau-Chaplin, A. (2001). A cluster architecture for parallel data warehousing. IEEE International Symposium of Cluster Computing and the Grid (CCGRid'01).
9. Dehne, F., Eavis, T., & Rau-Chaplin, A. (2006). The cgmCUBE project: Optimizing parallel data cube generation for ROLAP. Distributed and Parallel Databases, 19(1), 29-62.
10. Faloutsos, C., & Roseman, S. (1989). Fractals for secondary key retrieval. In Proceedings of the Symposium on Principles of Database Systems (pp. 247-252).
11. Goil, S., & Choudhary A. (1997). High performance OLAP and data mining on parallel computers. Journal of Data Mining and Knowledge Discovery, 1(4).
12. Gray, J., Bosworth, A., Layman, A., & Pirahesh, H. (1996). Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In Proceedings of the 12th International Conference On Data Engineering (pp. 152-159).
13. Gupta, H., Harinarayan, V., Rajaraman,A., & Ullman, J. (1997). Index selection for OLAP. In Proceedings of the 13th International Conference on Data Engineering (pp. 208-219).
14. Harinarayan, V., Rajaraman,A., & Ullman, J. (1996). Implementing data cubes. In Proceedings of the 1996 ACM SIGMOD Conference (pp. 205-216).
15. Juegens, M., & Lenz, H.-J. (1998). The Ra*-tree: An improved R-tree with materialized data for supporting range queries on OLAP-data. In DEXA Workshop (pp. 186-191).
16. Kamel, I., & Faloutsos, C. (1996). On packing R-trees. In Proceedings of the Second International Conference on Information and Knowledge Management (pp. 490-499).
17. Koudas, N., Faloutsos, C., & Kamel, I. (1996). Declustering spatial databases on a multi-computer architecture. In Proceedings of Extended Database Technologies (pp. 592-614).
18. Li, X., Lu, P., Schaefer, J., Shillington, J., Wong, P. S., & Shi, H. (1993). On the versatility of parallel sorting by regular sampling. Parallel Computing, 19(10), 1079-1103.
19. Moore, D. (2002). Fast Hilbert curve generation, sorting, and range queries. Retrieved February 8, 2008, from http://www.caam.rice.edu/ ~dougm/twiddle/Hilbert
20. Padmanabhan, S., Bhattacharjee, B., Malkemus, T., Cranston, L., & Huras, M. (2003). Multi-dimensional clustering: A new data layout scheme in DB2. In ACM SIGMOD (pp. 637-641).
21. Pendse, N., & Creeth, R. (2002), The OLAP report. Retrieved February 8, 2008, from http://www.olapreport.com
22. Ramsak, F., Markl, V., Fenk, R., Zirkel, M. Elhardt, K. & Bayer, R. (2000). Integrating the UB-tree into a database system kernel. In VLDB Conference (pp. 263-272).
23. Ross, K., & Srivastava, D.(1997). Fast computation of sparse data cubes, In Proceedings of the 23rd VLDB Conference (pp. 116-125).
24. Roussopolis, N., & Leifker, D. (1985). Direct spatial search on pictorial databases using packed R-trees. In Proceedings of the 1985 ACM SIGMOD Conference (pp. 17-31).
25. Roussopoulos, N., Kotidis, Y., & Roussopolis, M. (1997). Cubetree: Organization of the bulk incremental updates on the data cube. In Proceedings of the 1997 ACM SIGMOD Conference (pp. 89-99).
26. Sarawagi, S., Agarwal, R., & Gupta, A. (1996). On computing the data cube (Tech. Rep. RJ10026). San Jose, CA: IBM Almaden Research Center.
27. Schnitzer, B., & Leutenegger, S. (1999). Master-client R-trees: A new parallel architecture. In Proceedings of the 11th International Conference of Scientific and Statistical Database Management (pp. 68-77).
28. Sismanis, Y., Deligiannakis, A., Roussopoulos, N., & Kotidis, Y. (2002). Dwarf. Shrinking the petacube. In Proceedings of the 2002 ACM SIGMOD Conference (pp. 464-475).
29. Winter Corporation. (2005). Report. http://www.wintercorp.com