An Improved Dimension Hierarchy Aggregate Cube Storage Structure for Data Warehouses

Liang Zuopeng; Hu Kongfa; Dong Yisheng; Chen Ling

Journal of Computer Research and Development > 2005 > 42(8): 1362-1368.

Liang Zuopeng, Hu Kongfa, Dong Yisheng, Chen Ling. An Improved Dimension Hierarchy Aggregate Cube Storage Structure for Data Warehouses[J]. Journal of Computer Research and Development, 2005, 42(8): 1362-1368.

Citation:

PDF (496 KB)

An Improved Dimension Hierarchy Aggregate Cube Storage Structure for Data Warehouses

1(Department of Computer Science and Engineering, Southeast University, Nanjing 210096) 2(Department of Computer Science and Engineering, Yangzhou University, Yangzhou 225009)

More Information

Published Date: August 14, 2005

Graphical Abstract

Abstract

Abstract

In this paper it is proposed to create high performance DHAC (dimension hierarchy aggregate cube) with the dimension hierarchy aggregate technique on the cube. By using the dimension hierarchy of the dimension hierarchy aggregate tree, the DHAC can optimize the query efficiency and the update efficiency, and the cube semantic operation such as roll up and drill down can also be supported. The DHAC can incrementally update all the affected ancestor notes while updating the data cell by insertion and deletion in it. The DHAC can also incrementally update without being recreated while being added new dimension data in it. As a result, this algorithm can greatly reduce the update time. The algorithms of DHAC are compared with all the existing ones such as SDDC(space-efficient dynamic data cube) by more experiment. The analytical and experimental results show that the algorithms of DHAC proposed are more efficient than other existing ones.

FullText(HTML)

References (0)

[1]	Zhang Zilin, Liu Duo, Tan Yujuan, Wu Yu, Luo Longpan, Wang Weilüe, Qiao Lei. An Erasure-Coded Data Update Method for Distributed Storage Clusters[J]. Journal of Computer Research and Development, 2022, 59(11): 2451-2466. DOI: 10.7544/issn1000-1239.20210211
[2]	Lai Chengzhe, Zhang Min, Zheng Dong. A Secure and Efficient Map Update Scheme for Autonomous Vehicles[J]. Journal of Computer Research and Development, 2019, 56(10): 2277-2286. DOI: 10.7544/issn1000-1239.2019.20190314
[3]	Yan Xincheng, Chen Yue, Ba Yang, Jia Hongyong, Zhu Yu. Distributed Data Encoding Storage Scheme Supporting Updatable Encryption in Cloud[J]. Journal of Computer Research and Development, 2019, 56(10): 2170-2182. DOI: 10.7544/issn1000-1239.2019.20190351
[4]	Shen Yan, Zhu Yuquan, Liu Chunhua. Incremental FP_GROWTH Algorithm Based on Disk-resident 1-itemsets Counting[J]. Journal of Computer Research and Development, 2015, 52(3): 569-578. DOI: 10.7544/issn1000-1239.2015.20131436
[5]	Zhang Shuzhuang, Luo Hao, Fang Binxing. A Parallel Packet Classification Algorithm with Real-Time Incremental Updates[J]. Journal of Computer Research and Development, 2010, 47(11): 1903-1910.
[6]	Zhou Da, Liang Zhichao, Meng Xiaofeng. HF-Tree: An Update-Efficient Index for Flash Memory[J]. Journal of Computer Research and Development, 2010, 47(5): 832-840.
[7]	Xu Xueyong, Huang Liusheng, Huo Yongkai, Xiao Mingjun, and Xu Hongli. An Effective Location Updating Mechanism for Tracking Systems in Wireless Sensor Network[J]. Journal of Computer Research and Development, 2009, 46(12): 2143-2152.
[8]	Liao Wei, Xiong Wei, Jing Ning, Chen Hongsheng, and Zhong Zhinong. Hybrid Indexing of Moving Objects with Frequent Updates[J]. Journal of Computer Research and Development, 2006, 43(5): 888-893.
[9]	Song Yuqing, Zhu Yuquan, Sun Zhihui, Yang Hebiao. An Algorithm and Its Updating Algorithm Based on Frequent Pattern Tree for Mining Constrained Maximum Frequent Itemsets[J]. Journal of Computer Research and Development, 2005, 42(5): 777-783.
[10]	Gao Hongbin, Lin Youfang, and Huang Houkuan. An Incomplete Combination Lattice of Dimension and Its Incremental Construction Method[J]. Journal of Computer Research and Development, 2005, 42(3).