Materialized View Selection as Constrained Evolutionary Optimization

Research output: Contribution to journalArticle

Authors

Colleges, School and Institutes

Abstract

One of the important issues in data warehouse development is the selection of a set of views to materialize in order to accelerate a large number of on-line analytical processing (OLAP) queries. The maintenance-cost view-selection problem is to select a set of materialized views under certain resource constraints for the purpose of minimizing the total query processing cost. However, the search space for possible materialized views may be exponentially large. A heuristic algorithm often has to be used to find a near optimal solution. In this paper, for the maintenance-cost view-selection problem, we propose a new constrained evolutionary algorithm. Constraints are incorporated into the algorithm through a stochastic ranking procedure. No penalty functions are used. Our experimental results show that the constraint handling technique, i.e., stochastic ranking, can deal with constraints effectively. Our algorithm is able to find a near-optimal feasible solution and scales with the problem size well.

Details

Original languageEnglish
Pages (from-to)458-467
Number of pages10
JournalIEEE Transactions on Systems, Man and Cybernetics, Part C
Volume33
Issue number4
Publication statusPublished - 1 Nov 2003