Abstract
Data cube plays a key role in the analysis of multidimensional data. Nowadays, the explosive growth of multidimensional data has made distributed solutions important for data cube computation. Among the architectures for distributed processing, the shared-nothing architecture is known to have the best scalability. However, frequent and massive network communication among the processors can be a performance bottleneck in shared-nothing distributed processing. Therefore, suppressing the amount of data transmission among the processors can be an effective strategy for improving overall performance. In addition, dividing the workload and distributing them evenly to the processors is important. In this paper, the authors present a distributed algorithm for data cube computation that can be adopted in shared-nothing systems. The proposed algorithm gains efficiency by adopting the workload assignment strategy that reduces the total network cost and allocates the workload evenly to each processor, simultaneously.
| Original language | English |
|---|---|
| Pages (from-to) | 51-71 |
| Number of pages | 21 |
| Journal | International Journal of Data Warehousing and Mining |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2016 Jul 1 |
Keywords
- Data Cube
- Data Warehouse
- Distributed Processing
- OLAP
- ROLAP
- Shared-Nothing Architecture
ASJC Scopus subject areas
- Software
- Hardware and Architecture