A Multi-Objective Approach for Materialized View Selection

Abstract

In today's world, business transactional data has become the critical part of all business-related decisions. For this purpose, complex analytical queries have been run on transactional data to get the relevant information, from therein, for decision making. These complex queries consume a lot of time to execute as data is spread across multiple disparate locations. Materializing views in the data warehouse can be used to speed up processing of these complex analytical queries. Materializing all possible views is infeasible due to storage space constraint and view maintenance cost. Hence, a subset of relevant views needs to be selected for materialization that reduces the response time of analytical queries. Optimal selection of subset of views is shown to be an NP-Complete problem. In this article, a non-Pareto based genetic algorithm, is proposed, that selects Top-K views for materialization from a multidimensional lattice. An experiments-based comparison of the proposed algorithm with the most fundamental view selection algorithm, HRUA, shows that the former performs comparatively better than the latter. Thus, materializing views selected by using the proposed algorithm would improve the query response time of analytical queries and thereby facilitate in decision making.