Analysis of Materialization View Selection Approaches in Data Warehouse

In business Intelligence, accuracy and quick response are the main factors. Materialization view selection plays a crucial role in data warehouse to minimize query processing time. A data warehouse is a collection of multiple sets of queries, selection of the best view among various materialized views is an important task. Materialized view provides fast access to data which is required for decision-making in business. Many authors have suggested and proposed algorithms for materialized view selection that reduce the query computation time. In this paper we have done a systematic survey on various materialization approaches proposed by authors and compared with some parameters such as proposed work, constraints covered, the framework used, and implementation language. For view selection in lattice structure, we proposed an algorithm based on the brute force approach that selects the cuboids having least cost.