论文信息 - An Efficient MA-Based Materialized Views Selection Algorithm

An Efficient MA-Based Materialized Views Selection Algorithm

Materialized view selection is one of the most crucial techniques to design data warehouse in an optimal manner. To efficiently deal with materialized view selection problem, an efficient materialized view selection algorithm based on memtic algorithm(MA) is presented in this paper. Experimental results show that the proposed algorithm achieves much better performance than other related algorithms.

Ziqiang Wang | Xia Sun | Qingzhou Zhang

[1] Jeffrey Xu Yu,et al. What Difference Heuristics Make: Maintenance-Cost View-Selection Revisited , 2002, WAIM.

[2] Donald E. Grierson,et al. Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[3] Pablo Moscato,et al. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[4] Chen Jia,et al. Genetic Selection Algorithm for OLAP Data Cubes , 2010 .

[5] Inderpal Singh Mumick,et al. Selection of views to materialize in a data warehouse , 1997, IEEE Transactions on Knowledge and Data Engineering.

[6] Jian Yang,et al. Algorithms for Materialized View Design in Data Warehousing Environment , 1997, VLDB.

[7] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[8] Inderpal Singh Mumick,et al. Selection of Views to Materialize Under a Maintenance Cost Constraint , 1999, ICDT.

[9] Xin Yao,et al. An evolutionary approach to materialized views selection in a data warehouse environment , 2001, IEEE Trans. Syst. Man Cybern. Part C.

[10] Jorng-Tzong Horng,et al. Applying evolutionary algorithms to materialized view selection in a data warehouse , 2003, Soft Comput..

[11] Timos K. Sellis,et al. Data Warehouse Configuration , 1997, VLDB.