Mining information for constructing materialised views

A materialised view is constructed to improve response time for complex analytical queries posed on a large data warehouse. Most existing approaches use all the queries posed on the data warehouse for constructing materialised views. It is generally observed that, among all the queries posed on the data warehouse in the past, queries that are similar and more frequently posed have high likelihood of being posed again in future and are therefore, appropriate for constructing materialised views. The approach presented in this paper, attempts to select such frequently posed queries from among all the queries posed on the data warehouse. Further, since the materialised views are required to fit within the available storage space, the approach selects a subset of profitable frequent queries that conforms to the space constraint. The information accessed by these queries has high likelihood of being accessed again by future queries. Furthermore, it is experimentally shown that use of this information for constructing materialised views reduces query response time. This in turn would facilitate decision-making.

[1]  Wolfgang Lehner,et al.  Improving query response time in scientific databases using data aggregation -a case study , 1996, Proceedings of 7th International Conference and Workshop on Database and Expert Systems Applications: DEXA 96.

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

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

[4]  Xin Yao,et al.  Evolving materialized views in data warehouse , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  Rada Chirkova,et al.  A formal perspective on the view selection problem , 2002, The VLDB Journal.

[6]  Panos Kalnis,et al.  View selection using randomized search , 2002, Data Knowl. Eng..

[7]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[8]  W. H. Inmon,et al.  Building the Data Warehouse,3rd Edition , 2002 .

[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.

[10]  Jeffrey D. Ullman,et al.  Index selection for OLAP , 1997, Proceedings 13th International Conference on Data Engineering.

[11]  Jorng-Tzong Horng,et al.  Applying evolutionary algorithms to materialized view selection in a data warehouse , 2003, Soft Comput..

[12]  Nick Roussopoulos,et al.  Materialized views and data warehouses , 1998, SGMD.

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

[14]  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).

[15]  Inderpal Singh Mumick,et al.  Selection of Views to Materialize in a Data Warehouse , 2005, IEEE Trans. Knowl. Data Eng..

[16]  John F. Roddick,et al.  Advances and Research Directions in Data-Warehousing Technology , 1999, Australas. J. Inf. Syst..

[17]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[18]  W. H. Inmon,et al.  Building the data warehouse , 1992 .

[19]  Surajit Chaudhuri,et al.  Automated Selection of Materialized Views and Indexes in SQL Databases , 2000, VLDB.

[20]  Timos K. Sellis,et al.  Data Warehouse Configuration , 1997, VLDB.