Research on Materialized View Selection Algorithm in Data Warehouse
In view of some deficiencies which traditional static materialized view selection algorithms have, the paper brings forward an efficient materialized view selection adjustment algorithm which could overcome some deficiencies such as large storage, long running time and different querying probability. Besides,the algorithm can be carried out simultaneously from source data to data warehouse immediately when the changes occur in source database. It integrates some advantages such as PBS, IGA and so on, performances of the algorithm has been proved in experiment. The efficient materialized view selection adjustment algorithm reduces search spaces and shortens running time. Most of all, the algorithm considers materialized views mutual relations in influencing view benefit Consequently, the algorithm can be dynamicly adjusted online and attains anticipative purpose. It makes some contributions for materialized view selection.
materialized view1 MVA2 data warehouse3 query probability4
Zhou Lijuan Ge Xuebin Wang Linshuang Shi Qian
Capital Normal University, Information Engineering College, Beijing 100048, China
国际会议
重庆
英文
808-811
2009-12-25（万方平台首次上网日期，不代表论文的发表时间）