English

应用科学学报 ›› 2003, Vol. 21 ›› Issue (2): 137-140.

• 论文 • 上一篇    下一篇

多维数据仓库系统中高性能DCA-Tree Cube的研究

胡孔法, 董逸生, 徐立臻, 庄晓青, 杨科华   

  1. 东南大学计算机科学与工程系 江苏 南京 210096
  • 收稿日期:2002-05-31 修回日期:2002-07-30 出版日期:2003-06-10 发布日期:2003-06-10
  • 作者简介:胡孔法(1970-),男,安徽安庆人,工程师,博士生;重逸生(1940-),男,江苏启东人,教授,博导.
  • 基金资助:
    国家863/CIMS基金(6409002012);江苏省九五重点攻关课题(BG98017-1);江苏省十五高科技项目(BG2001013)

A Research on the High Performance DCA-Tree Cube in the Multidimensional Data Warehouse System

HU Kong-fa, DONG Yi-sheng, XU Li-zhen, ZHUANG Xiao-qing, YANG Ke-hua   

  1. Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China
  • Received:2002-05-31 Revised:2002-07-30 Online:2003-06-10 Published:2003-06-10

PDF

139

被引次数

4

摘要： 提出了利用R*-tree改进的DCA-tree (data cube aggregate-tree)来创建高性能的DCA-tree cube聚集cube,阐述了创建DCA-tree cube、DCA-tree cube增量更新和MOLAP快速查询等关键技术。算法分析表明,所提出的DCA-tree cube在查询和更新效率方面要比以往DDC等方法创建的cube要高,解决了在插入新维数据时cube增量的更新维护。

关键词: 多维数据仓库, 数据立方体聚集树立方体, 多维联机分析处理, 增量更新, 聚集技术, 范围查询

Abstract: In this paper, the authors propose using the DCA-tree (a modified version of the R*-tree) to create the high performance data cube aggregate-tree cube (DCA-tree cube). The authors also describe the key techniques such as DCA-tree cube creating, MOLAP rapid querying, DCA-tree cube incremental updating, etc. The analytical result of the algorithm shows that the performance of the DCA-tree cube in querying and updating is better than that of the cube created by the aggregate techniques such as dynamic data cube (DDC), etc. The DCA-tree cube can update incrementally while new data of some dimensions are inserted.

Key words: data cube aggregate-tree cube (DCA-tree cube), multidimensional on-line analysis process (MOLAP), range queries, aggregate technique, incrementally updating, multidimensional data warehouse

中图分类号: