摘要
有效的实现数据立方体的计算是提高数据仓库查询效率的有力方法。在设计方体时要对方体维护成本和查询响应时间这两个因素加以考虑,从而产生了方体的部分物化和全物化两种方法。通过对数据仓库中如何有效的进行数据立方体计算的讨论,提出了实现数据立方体部分物化和全物化的算法。
Efficiently realizing the data cubes computing is a powerful tool to increase the query efficiency of the data warehouse. The maintenance cost of the data cubes and the response time to queries are two practical parameters concerning about the design of a cube - based data warehouse system. Hence, it leads to the two main ways to materialize the cube —— partial materialization and full materialization. According to the discussion about that how to efficiently realize the cube computing in data warehouse, this paper presents the algorithrns for implementing two kinds of materialization of the cubes.
出处
《信息技术》
2005年第8期42-45,共4页
Information Technology
关键词
数据仓库
数据立方体
部分物化
全物化
贪心算法
多路数组聚集
data warehouse
data cube
partial materialization
full materialization
greedy algorithm
multiway array aggregation