Materialized View Selection Algorithm for Query Set Covering
In order to implement materialized view selection in large capacity physical storage conditions data warehouse,a materialized view selection algorithm for query set covering is proposed.Firstly some concepts and definitions is introduced,then the candidate view set is extracted and cut from data cube,the benefit model is defined,the minimum profits redundant view response query set is filtered one by one when view′s capacity beyond storage limit at last,eventually the optimization materialized view set for query set covering is obtained.The experimental results show that the proposed algorithm can obtain better performance in large storage condition than the previous algorithm,eliminate the time delay "jitter" phenomenon when materialized view in response query set and the average response time delay is also greatly shortened.