Shuffled Frog Leaping Algorithm for Materialized Views Selection

Materialized view selection is one of the key techniques for speeding up query answer in a data warehouse environment. To effectively and efficiently deal with this problem, a novel shuffled frog leaping (SFL) algorithm for materialized view selection is proposed in this paper. Experimental results on the TPC-D benchmark data sets show that the proposed algorithm out-performs other well-known algorithms in terms of total maintenance cost and query response time.