The algorithm of view selection for materializing in specialized data warehouses

In this paper, the algorithm of view selection for materializing in specialized data warehouse on basis of the data domain information is presented. The purpose of the proposed algorithm is to minimize the materialization cost by selecting an optimal set of materialized views constrained by actual space from candidate view subsets. The candidate view subsets are formed from set of calculated strategies ordered by decrease of relevance. The main advantage of our approach is to support the administrator by the proactive method of materialized view selection in specialized data warehouse to be developing the starting data warehouse model and its updating in the evolution process.