Efficient materialized view selection dynamic improvement algorithm

Authors:
Zhou Lijuan;Ge Xuebin;Wang Linshuang;Shi Qian
Affiliations:
Information Engineering College of Capital Normal University, Beijing;Information Engineering College of Capital Normal University, Beijing;Information Engineering College of Capital Normal University, Beijing;Information Engineering College of Capital Normal University, Beijing
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
Year:
2009

Citing 3
Cited 0

Implementing data cubes efficiently

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The view-selection problem has an exponential-time lower bound for conjunctive queries and views

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automated Selection of Materialized Views and Indexes in SQL Databases

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Because static materialized views selection algorithm has many shortcomings, such as larger search space, higher time consumption and excluding query probability and distribution, and the changes in data sources can't be reflected in datawarehouse immediately. In view of this' this paper implements dynamic adjustment for static materialized views selection algorithm according to CVLC and IGA, that is, EMVSDIA Algorithm. The algorithm has been proved in reducing search space and time consumption by the experiment. Most of all, because the algorithm considers materialized views mutual relations in influencing view benefit. Consequently, the algorithm can be dynamicly adjusted online and obtains anticipative purpose.