PHC: A Rapid Parallel Hierarchical Cubing Algorithm on High Dimensional OLAP
Data cube has been playing an essential role in OLAP (online analytical processing). The pre-computation of data cubes is critical for improving the response time of OLAP systems. However, as the size of data cube grows, the time it takes to perform this pre-computation becomes a significant performance bottleneck. In a high dimensional OLAP, it might not be practical to build all these cuboids and their indices. In this paper, we propose a parallel hierarchical cubing algorithm, based on an extension of the previous minimal cubing approach. The algorithm has two components: decomposition of the cube space based on multiple dimension attributes, and an efficient OLAP query engine based on a prefix bitmap encoding of the indices. This method partitions the high dimensional data cube into low dimensional cube segments. Such an approach permits a significant reduction of CPU and I/O overhead for many queries by restricting the number of cube segments to be processed for both the fact table and bitmap indices. The proposed data allocation and processing model support parallel I/O and parallel processing, as well as load balancing for disks and processors. Experimental results show that the proposed parallel hierarchical cubing method is significantly more efficient than other existing cubing methods.
Keywordsdata cube parallel hierarchical cubing algorithm (PHC) high dimensional OLAP
Unable to display preview. Download preview PDF.
- 2.Wu, K., Otoo, E.J., Shoshani, A.: A performance comparison of bitmap indexes. CIKM pp. 559–561 (2001)Google Scholar
- 3.Mistry, H., Roy, P., Sudarshan, S.: Materialized view selection and maintenance using multi-query optimization. SIGMOD 2001, pp. 307–318 (2001)Google Scholar
- 4.Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Datacube: A relational aggregation operator generalizing group-by, cross-tab and subtotals. Data Mining and Knowledge Discovery 1, pp. 29–54 (2001)Google Scholar
- 5.Beyer, K., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. ACM SIGMOD, pp. 359–370 (1999)Google Scholar
- 6.Han, J., Pei, J., Dong, G., Wang, K.: Efficient computation of iceberg cubes with complex measures. ACM SIGMOD, pp.1–12 (2001)Google Scholar
- 7.Lakshmanan, L.V.S., Pei, J., Han, J.: Quotient cubes: how to summarize the semantics of a data cube. VLDB, pp. 778–789 (2002)Google Scholar
- 8.Xin, D., Han, J., Li, X., Wah, B.W.: Star-cubing:computing iceberg cubes by top-down and bottom-up integration. VLDB, pp. 476–487 (2003)Google Scholar
- 9.Sismanis, Y., Deligiannakis, A., Kotidis, Y., Roussopoulos, N.: Hierarchical dwarfs for the rollup cube. VLDB, pp. 540–551 (2004)Google Scholar
- 10.Lakshmanan, L. V. S., Pei, J., and Zhao, Y.: QC-trees: An efficient summary structure for semantic OLAP. ACM SIGMOD, pp. 64–75 (2003)Google Scholar
- 11.Li, X., Han, J., Gonzalez, H.: High-dimensional OLAP: A minimal cubing approach. VLDB, pp. 528–539 (2004)Google Scholar