维护代价约束下的物化视图选择  

Materialized view selection under a maintenance-cost constraint

作　　者：裴丽鹊[1] 吕晓华[2] 

机构地区：[1]福建对外经济贸易职业技术学院物流与信息管理系,福建福州350016 [2]浙江理工大学信息电子学院,浙江杭州310018

出　　处：《闽江学院学报》2008年第5期58-62,共5页Journal of Minjiang University

摘　　要：物化视图的选择是数据仓库设计重要的决策之一.探讨在一定维护代价约束条件下,在检索过程中总检索成本最优化的问题,并提出新的动态算法-最小/最大侯选变换算法.该算法的关键是基于最小有效的极大基数配比技术和通过构建索引而设计的代价计算模型来获得最大候选集.实验结果显示这个算法是高效的、动态的、近似最优的.Materialized views selection is one of the key strategies in the design of data warehouse. This paper studies the optimization of general retrieval cost in the process of retrieval under certain maintenance cost with constraints, and puts forward a new dynamic algorithm-the Min/Max candidate set transforming,whose critical technology is based on minimum weighted maximum eardinality matching technique The cost model of the algorithm uses the gain index to obtain the maximum candidate views set. Experimental resuits shows that this algorithm is efficient, dynamic and approximate optimal.

关 键 词：维护代价 物化视图 视图选择 构建索引 数据仓库 

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