【摘要】 提出了利用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.更多还原