论文信息 - Algorithm for selection of materialized views: based on a costs model

Algorithm for selection of materialized views: based on a costs model

A data warehouse integrates businesses' information from both inner and outer data sources. The data set is use to assist the decision taking process, therefore, the multidimensional model design and the selection of materialized views represent a complex and thoughtful process. In this paper, a new algorithm for the selection of optimum set of materialized views is proposed. The proposed algorithm establishes this set based on the utilization rate, calculation cost and the relationship update rate. The development of this work was made within a medical research project, allowing the testing and validation of the proposed algorithm under a real-life application.

M. T. Serna-Encinas | J. A. Hoyo-Montano

[1] Zohra Bellahsene,et al. Selection of Materialized Views: a Cost-Based Approach , 2003, BDA.

[2] Jian Yang,et al. Algorithms for Materialized View Design in Data Warehousing Environment , 1997, VLDB.

[3] Jeffrey D. Ullman,et al. Implementing data cubes efficiently , 1996, SIGMOD '96.

[4] Divesh Srivastava,et al. Answering Queries Using Views. , 1999, PODS 1995.

[5] Inderpal Singh Mumick,et al. Selection of views to materialize in a data warehouse , 1997, IEEE Transactions on Knowledge and Data Engineering.

[6] Inderpal Singh Mumick,et al. The Stanford Data Warehousing Project , 1995 .

[7] Hamid Pirahesh,et al. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.

[8] Qing Li,et al. Design and selection of materialized views in a data warehousing environment: a case study , 1999, DOLAP '99.

[9] Xin Yao,et al. An evolutionary approach to materialized views selection in a data warehouse environment , 2001, IEEE Trans. Syst. Man Cybern. Part C.