Computing high dimensional MOLAP with parallel shell mini-cubes

  • Authors:
  • Kong-fa Hu;Chen Ling;Shen Jie;Gu Qi;Xiao-li Tang

  • Affiliations:
  • Department of Computer Science and Engineering, Yangzhou University;Department of Computer Science and Engineering, Yangzhou University;Department of Computer Science and Engineering, Yangzhou University;Department of Computer Science and Engineering, Yangzhou University;Department of Computer Science and Engineering, Yangzhou University

  • Venue:
  • FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

MOLAP is a important application on multidimensional data warehouse. We often execute range queries on aggregate cube computed by pre-aggregate technique in MOLAP. For the cube with d dimensions, it can generate 2d cuboids. But in a high-dimensional cube, it might not be practical to build all these cuboids. In this paper, we propose a multi-dimensional hierarchical fragmentation of the fact table based on multiple dimension attributes and their dimension hierarchical encoding. This method partition the high dimensional data cube into shell mini-cubes. The proposed data allocation and processing model also supports parallel I/O and parallel processing as well as load balancing for disks and processors. We have compared the methods of shell mini-cubes with the other existed ones such as partial cube and full cube by experiment. The results show that the algorithms of mini-cubes proposed in this paper are more efficient than the other existed ones.