A game theory based framework for materialized view selection in data warehouses

Data warehouses exploit On-Line Analytical Processing (OLAP) to make rapid answers for analytical queries. Huge amount of aggregated data within a data warehouse on the one hand, and complex analytical queries raised in a data warehouse on the other hand, increase response time to queries extremely. To solve this problem, a number of views are derived and extracted from original base tables and queries have been answered using them. Since materialization of all possible views is not effective because of limitation of storage and maintenance overhead, selecting an optimal set of views for materialization is crucial to maximize data warehouse performance. In this paper, a game theory based framework for the materialized view selection is proposed. In the proposed framework, query processing and view maintenance costs play a game against each other as two players and continue the game until reach the equilibrium. According to the framework, a new static method, called Game Theory based Materialized View selection (GTMV), has been proposed. Verification of proposed approach has been evaluated using several synthetic and real world datasets. Experimental results show that the GTMV method has better performance comparing previous algorithms and substantially outperform former methods.