数据仓库系统中层次式cube 存储结构 - citeseerx.pdfVIP

1000-9825/2003/14(07)1258 ©2003 Journal of Software 软 件 学 报 Vol.14, No.7 ∗ 数据仓库系统中层次式 Cube 存储结构 + 高 宏 , 李建中, 李金宝 (哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001) (黑龙江大学 计算机科学与技术学院,黑龙江 哈尔滨 150086) Hierarchical Cube Storage Structure for Data Warehouses + GAO Hong , LI Jian-Zhong, LI Jin-Bao (School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) (School of Computer Science and Technology, Heilongjiang University, Harbin 150086, China) + Corresponding author: Phn: 86-451-6415827, Fax: 86-451-6415827, E-mail: gaohong@ Received 2002-11-25; Accepted 2003-03-04 Gao H, Li JZ, Li JB. Hierarchical cube storage structure for data warehouses. Journal of Softw are, 2003,14(7):1258~1266. /1000-9825/14/1258.htm Abstract: Range query is a very important operation to support On-Line Analytical Processing (OLAP) in data warehouses. Although several cube storage structures for range sum queries and dynamic updates have been introduced recently . However, the complexities of both space and time are too higher to realistic. To solve this problem, a hierarchical data cube (HDC) and corresponding algorithms are provided in this paper. Both of the range query and update costs of HDC are O(logdn), and the overall cost is O((logn)2d) (under the C C model) or O(K q u d (logn) ) (under the C n +C n model). The analytical and experimental results show that the costs of HDC’s range q q u u queries, dynamic updates, storage space and the overall performance of HDC are superior to other cubage stor