%0 Journal Article
%T Parallel Data Cube Storage Structure for Range Sum Queries and Dynamic Updates
%A Hong GAO
%A Jian-Zhong Li
%A <br>Hong Gao
%A and
%A Jian-Zhong Li
%J 计算机科学技术学报
%D 2005
%I 
%X 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(logdn/P). The analytical and experimental results show that PHC and the parallel algorithms have high performance and achieve optimum speedup.
%K data warehouse
%K parallel processing
%K cube
%K range query processing<br>数据仓库
%K 并行处理
%K 立方体
%K 范围查询
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=1402E980F04733016AE86611BA304563&yid=2DD7160C83D0ACED&vid=A04140E723CB732E&iid=38B194292C032A66&sid=3622B70F9C54A9CC&eid=35E8A259891FB32F&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=16