Efficient Utilization of Materialized Views in a Data Warehouse

View Materialization is an effective method to increase query efficiency in a data warehouse. However, one encounters the problem of space insufficiency if all possible views are materialized in advance. Reducing query time by means of selecting a proper set of materialized views with a lower cost is crucial for efficient data warehousing. In addition, the costs of data warehouse creation, query, and maintenance have to be taken into account while views are materialized. The purpose of this research is to select a proper set of materialized views under the storage and cost constraints and to help speedup the entire data warehousing process. We propose a cost model for data warehouse query and maintenance along with an efficient view selection algorithm, which uses the gain and loss indices. The main contribution of our paper is to speedup the selection process of materialized views. The second one is to reduce the total cost of data warehouse query and maintenance.

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

[2]  Timos K. Sellis,et al.  Answering multidimensional queries on cubes using other cubes , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.

[3]  Stephen Morse,et al.  Parallel Systems in the Data Warehouse , 1997 .

[4]  Alberto O. Mendelzon,et al.  Maintaining data cubes under dimension updates , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[5]  Jennifer Widom,et al.  Proceedings of the 1996 ACM SIGMOD international conference on Management of data , 1996, PODS 1996.

[6]  Inderpal Singh Mumick,et al.  Selection of Views to Materialize Under a Maintenance Cost Constraint , 1999, ICDT.

[7]  Timos K. Sellis,et al.  Designing Data Warehouses , 1999, Data Knowl. Eng..

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

[9]  Cheng-Yan Kao,et al.  Materialized view selection using genetic algorithms in a data warehouse system , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Surajit Chaudhuri,et al.  Materialized view and index selection tool for Microsoft SQL server 2000 , 2001, SIGMOD '01.

[11]  Kenneth A. Ross,et al.  Materialized view maintenance and integrity constraint checking: trading space for time , 1996, SIGMOD '96.

[12]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[13]  Jehoshua Bruck,et al.  Partial-Sum Queries in OLAP Data Cubes Using Covering Codes , 1998, IEEE Trans. Computers.

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

[15]  Chi Liu,et al.  Selecting materialized views in a data warehouse , 2003, IS&T/SPIE Electronic Imaging.

[16]  Jian Yang,et al.  A framework for designing materialized views in data warehousing environment , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[17]  Jeffrey F. Naughton,et al.  Materialized View Selection for Multidimensional Datasets , 1998, VLDB.

[18]  Maria E. Orlowska,et al.  Making Multiple Views Self-Maintainable in a Data Warehouse , 1999, Data Knowl. Eng..