An efficient and flexible approach to maintenance-cost view selection
Xiaohua Lv, Zhenhua Huang, Lican Huang, Jianlong Xu, Yongsheng Xue · China-Ireland International Conference on Information and Communications Technologies (CIICT 2007) · 2007
The maintenance-cost view-selection problem is one of the important issues in data warehouse design. It deals with selecting a set of materialized views under a maintenance cost constraint (such as maintenance time) in order to minimize the total query processing cost for a given set of queries. The problem has recently received significant attention. Several greedy and heuristic algorithms were proposed. However, the quality of these approaches will not be guaranteed well in realistic cases. In this paper, we developed a novel and flexible algorithm, named min/max candidate set transforming (MMCST). Specially, constructing the maximum candidate set is based on the minimum weighted maximum cardinality matching technique and the cost model of our algorithm uses the gain index. Both theoretical and experimental results show that the proposed algorithm is a powerful, efficient, and flexible approach to this problem.