Research and Optimization of Materialized Views Selection Algorithm Based on the Data Warehouse

Materialized view is an effective mothed for improving the efficiency of queries in data warehouse system,and materialized views selection problem is one of the most important decisions in designing a data warehouse.This paper begins with a brief introduction to materialized view and study of the existing materialized viewalgorithm.Then in order toselect an appropriate set of views that minimizes total query response timeand the cost of maintaining the selected views under a limitedstorage space, a hybrid algorithm combined with the advantages of ant colony algorithm and immune genetic algorithm is proposed.Inaddition,analyze the shortcomings of this algorithm and propose some improvement ideas, which optimize the efficiency of algorithm to some extent.