Random Walk Grey Wolf Optimizer Algorithm for Materialized View Selection (RWGWOMVS)

Abstract

Optimal selection of materialized views is crucial for enhancing the performance and efficiency of data warehouse to render decisions effectively. Numerous evolutionary optimization algorithms like particle swarm optimization (PSO), genetic algorithm (GA), bee colony optimization (BCO), backtracking search optimization algorithm (BSA), etc. have been used by researchers for the selection of views optimally. Various frameworks like multiple view processing plan (MVPP), lattice, and AND-OR view graphs have been used for representing the problem space of MVS problem. In this chapter, the authors have implemented random walk grey wolf optimizer (RWGWO) algorithm for materialized view selection (i.e., RWGWOMVS) on lattice framework to find an optimal set of views within the space constraint. RWGWOMVS gives superior results in terms of minimum total query processing cost when compared with GA, BSA, and PSO algorithm. The proposed method scales well on increasing the lattice dimensions and on increasing the number of queries triggered by users.