期刊名称：International Journal of Computer Science, Engineering and Applications (IJCSEA)
印刷版ISSN：2231-0088
电子版ISSN：2230-9616
出版年度：2014
卷号：4
期号：6
DOI：10.5121/ijcsea.2014.4602
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：In this paper we propose an approach, which is based on Markov Chain, to cluster and recommendcandidate views for the selection algorithm of materialized views. Our idea is to intervene at regular periodof time in order to filter the candidate views which will be used by an algorithm for the selection ofmaterialized views in real-time data warehouse. The aim is to reduce the complexity and the execution costof the online selection of materialized views. Our experiment results have shown that our solution is veryefficient to specify the more profitable views and to improve the query response time.
关键词：Query response time optimization; Materialized view selection; View clustering; candidate View;recommendation; real-time data warehouse; Markov chain
