受限多维物化视图选择算法

Algorithm of Multidimensional Materialized View Selection Under Cost Constraints

受限物化视图的选择是当前数据仓库研究的最重要的问题之一。提出利用最小祖先树筛选视图,并结合改进的试探式策略进行物化视图选择的算法。该算法能有效地解决物化视图的两类问题。理论分析与实验结果表明在数据维度大、维层次复杂的情况下,与以往算法相比,该算法有着更优执行的效率。

Materialized view selection under cost constraint is one of the most important issues in data warehouse development. This paper firstly presents a materialized view selection algorithm, which selects views to materialize based on the minimal ancestor tree and implements with an improved heuristic strategy. This algorithm can effectively solve the two kinds of problems on selecting views to materialize. Both theory and experiment results show that the algorithm is more efficient than the previous algorithm under high dimension situations.