Parallel data cube storage structure for range sum queries and dynamic updates
I/O parallelism is considered to be a promising approach to achieving high performance in parallel data warehousing systems where huge amounts of data and complex analytical queries have to be processed. This paper proposes a parallel secondary data cube storage structure (PHC for short) to efficiently support the processing of range sum queries and dynamic updates on data cube using parallel computing systems. Based on PHC, two parallel algorithms for processing range sum queries and updates are proposed also. Both the algorithms have the same time complexity, O(log(d) n/P). The analytical and experimental results show that PHC and the parallel algorithms have high performance and achieve optimum speedup.
cube data warehouse parallel processing range query processing