利用维护代价约束的物化视图选择方法  

Materialized view selection under maintenance cost constraint

作　　者：冯少荣[1] 

机构地区：[1]厦门大学信息科学与技术学院,福建厦门361005

出　　处：《华中科技大学学报（自然科学版）》2009年第5期57-60,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(50474033)

摘　　要：为了在一定维护代价约束条件下,使查询过程中花费的总查询成本最优化,提出了最小/最大候选集变换算法.该算法构造最大候选视图集和最小候选视图集,基于最小有效的极大基数配比技术,并通过单位维护代价内的查询收益而设计的代价计算模型来获得最佳物化视图集.理论分析和实验结果表明该算法是高效、动态、近似最优的.与以往算法相比,在数据维度大、维层次复杂的情况下,该算法有着更优的执行效率.In order to minimize the total query processing cost for a given set of queries under maintenance cost constraint, min/max candidate set transforming algorithm was proposed, in which MACVS （maximum candidate views set） and MICVS（minimum candidate views set） were constructed. The best materialized views set was gained by the cost calculation model which was designed using maximum matching method of minimizing effective and in order of query benefit per unit maintenance-cost. Both the theoretical analysis and the experimental results showed that the algorithm is efficient, flexible and approximately optimal. The algorithm is more efficient than the previous algorithm under high dimension situations.

关 键 词：物化视图 视图选择 维护代价 候选集 查询收益 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]