Parallel Data Cube Storage Structure for Range Sum Queries and Dynamic Updates

I/O parallelism is considered to be a promising approach to achievinghigh performance in parallel data warehousing systems where hugeamounts 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 sumqueries and dynamic updates on data cube using parallel computingsystems. Based on PHC, two parallel algorithms for processing range sumqueries and updates are proposed also. Both the algorithms have the same time complexity, O(log^dn/P). The analytical and experimentalresults show that PHC and the parallel algorithms have high performanceand achieve optimum speedup.