Parallel hierarchical data cube for range sum queries and dynamic updates

While there are several studies on cube storage for range queries and dynamic updates, very few works have been done on addressing parallel cube storage structure in share nothing environments to improve the query performance. In this paper, we investigate the approach of how to answer range sum queries in a share nothing environment, and present an effective parallel hierarchical data cube storage structure (PHDC for short), which provides better load balancing for both range sum queries and updates. Analytical and experimental results show that PHDC have better load-balance and achieve optimum speed-up for a very high percentage of range queries on multidimensional data cube.