The Model and Realization of Materialized Views Selection in Data Warehouse

The data warehouse is a repository of information collected from multiple, possibly heterogeneous, autonomous, distributed databases. The information stored at the data warehouse is in form of views referred to as materialized vies. One of the most important decisions in designing a data warehouse is selection of right views to be materialized So, we develop algorithms to select a set of views to materialize in data warehouse in order to minimize the total view maintenance cost under the constraint of a given query response time. We call it query cost view selection problem (QC_VSP). In this paper, First, we propose the cast model of QC_VSP Second; we design algorithms for QC_VSP. Third; we use experiments do demonstrate the porter of our approach.