Mining Queries for Constructing Materialized Views in a Data Warehouse

A data warehouse stores historical information, continuously being generated over time, to support decision making. The queries posed for decision making are usually exploratory, long, complex and analytical in nature. These queries, when posed against a large and continuously growing data warehouse, consume a lot of time for processing and thereby resulting in high response times. This problem of high response time can be addressed by constructing materialized views on the data warehouse. These views, which store data along with its definition, cannot be arbitrarily constructed as they need to contain relevant and required information for answering most future queries. The approach proposed in this paper attempts to identify such information, from previously posed queries on a data warehouse, using clustering and association rule mining techniques. The information identified using the approach is likely to answer most future queries in reduced query response times. As a result, the decision making would become more efficient.

[1]  Sartaj Sahni,et al.  Information Intelligence, Systems, Technology and Management - 5th International Conference, ICISTM 2011, Gurgaon, India, March 10-12, 2011. Proceedings , 2011, ICISTM.

[2]  Elena Baralis,et al.  Materialized Views Selection in a Multidimensional Database , 1997, VLDB.

[3]  Dimitri Theodoratos,et al.  Constructing search spaces for materialized view selection , 2004, DOLAP '04.

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

[5]  Kalyani Devi,et al.  Frequent queries identification for constructing materialized views , 2011, 2011 3rd International Conference on Electronics Computer Technology.

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

[7]  Edwin L. Bradley,et al.  A nonparametric measure of the overlapping coefficient , 2000 .

[8]  T. V. Vijay Kumar,et al.  Selection of Views for Materialization Using Size and Query Frequency , 2011 .

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

[10]  Sartaj Sahni,et al.  Information Systems, Technology and Management - Third International Conference, ICISTM 2009, Ghaziabad, India, March 12-13, 2009. Proceedings , 2009, ICISTM.

[11]  Srija Unnikrishnan,et al.  Advances in Computing, Communication, and Control , 2011 .

[12]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[13]  Ettore Saltarelli,et al.  View Materialization vs. Indexing: Balancing Space Constraints in Data Warehouse Design , 2003, CAiSE.

[14]  T. V. Vijay Kumar,et al.  Proposing Candidate Views for Materialization , 2010, ICISTM.

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

[16]  T. V. Vijay Kumar,et al.  A Query Answering Greedy Algorithm for Selecting Materialized Views , 2010, ICCCI.

[17]  Ford Lumban Gaol,et al.  Information Technology and Mobile Communication , 2011 .

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

[19]  T. V. Vijay Kumar,et al.  A View Recommendation Greedy Algorithm for Materialized Views Selection , 2011, ICISTM.

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

[21]  Jennifer Widom,et al.  Research problems in data warehousing , 1995, CIKM '95.

[22]  T. V. Vijay Kumar,et al.  Greedy Views Selection Using Size and Query Frequency , 2011 .

[23]  Neeraj Jain,et al.  Selection of Frequent Queries for Constructing Materialized Views in Data Warehouse , 2010 .

[24]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[25]  Luping Ding,et al.  Dynamic Materialized Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

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

[27]  T. V. Vijay Kumar,et al.  A Reduced Lattice Greedy Algorithm for Selecting Materialized Views , 2009, ICISTM.

[28]  Jérôme Darmont,et al.  Data mining-based materialized view and index selection in data warehouses , 2007, Journal of Intelligent Information Systems.

[29]  Neeraj Jain,et al.  Mining information for constructing materialised views , 2010, Int. J. Inf. Commun. Technol..

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

[31]  Michael Lawrence,et al.  Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses , 2006, GECCO '06.

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

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