Title :
The algorithm of view selection for materializing in specialized data warehouses
Author_Institution :
Inst. of Comput. Modelling, SB RAS, Krasnoyarsk, Russia
Abstract :
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.
Keywords :
data warehouses; candidate view subsets; data domain information; materialization cost minimization; materialized view selection; proactive method; specialized data warehouses; starting data warehouse model; Algorithm design and analysis; Context; Data models; Data warehouses; Databases; Lattices; Maintenance engineering;
Conference_Titel :
MIPRO, 2011 Proceedings of the 34th International Convention
Conference_Location :
Opatija
Print_ISBN :
978-1-4577-0996-8
