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

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

3165-3170

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Gu Junhua, Zhao Xiuli, TanQing. Computer Applications, 27(2007) 2763-2769.

Google Scholar

[2] Gong An, DouWanrui, WangYan. microcomputer applications, 31(2010) 15-20.

Google Scholar

[3] Zhang C, YaoX, Yang J. IEEE Transactions on System, Man, and Cybernetics-PartC: Applications and Reviews, 31(2007) 282-294.

Google Scholar

[4] Horng JT, Chang Y J, Liu B J. Soft Computing, 7(2003) 574-581.

Google Scholar

[5] Wang Ziqiang, SunXia, ZhangDexian. Journal of Chinese Computer Systems, 2(2007) 367-371.

Google Scholar

[6] Hong Zhang, Aiping Li. Computer Engineering, 35(2009) 34-37.

Google Scholar