Materialized View Selection Using Memetic Algorithm

A data warehouse stores historical data for the purpose of answering strategic and decision making queries. Such queries are usually exploratory and complex in nature and have high response time when processed against a continuously growing data warehouse. These response times can be reduced by materializing views in a data warehouse. These views, which contain pre-computed and summarized information, aim to provide answers to decision making queries in an efficient manner. All views cannot be materialized due to space constraints. Also, optimal view selection is shown to be an NP-Complete problem. Alternatively, several view selection algorithms exist, most of these being empirical or based on heuristics like greedy, evolutionary etc. In this paper, a memetic view selection algorithm, that selects the Top-T views from a multi-dimensional lattice, is proposed. This algorithm incorporates the local search improvement heuristic, i.e. Iterative Improvement, into the evolutionary manner for selecting an optimal set of views, from amongst all possible views, in a multidimensional lattice. The purpose is to efficiently select good quality views. This algorithm, in comparison to the better known greedy view selection algorithm, is able to efficiently select better quality views for higher dimensional data sets.

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

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

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

[4]  Carlos Cotta,et al.  Memetic algorithms and memetic computing optimization: A literature review , 2012, Swarm Evol. Comput..

[5]  Matteo Golfarelli,et al.  View materialization for nested GPSJ queries , 2000, DMDW.

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

[7]  A. Alkan,et al.  Memetic algorithms for timetabling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[8]  Ender Özcan,et al.  Steady State Memetic Algorithm for Partial Shape Matching , 1998, Evolutionary Programming.

[9]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[10]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[11]  William E. Hart,et al.  Memetic Evolutionary Algorithms , 2005 .

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

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

[14]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[16]  T. V. Vijay Kumar,et al.  Materialized View Selection Using Iterative Improvement , 2012, ACITY.

[17]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[18]  Kamalakar Karlapalem,et al.  View Relevance Driven Materialized View Selection in Data Warehousing Environment , 2002, Australasian Database Conference.

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

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

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

[22]  Sartaj Sahni,et al.  Simulated Annealing and Combinatorial Optimization , 1986, DAC 1986.

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

[24]  Yannis E. Ioannidis,et al.  Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.

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

[26]  Gang Luo,et al.  Partial Materialized Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

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

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

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

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

[31]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

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

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

[34]  T. V. Vijay Kumar,et al.  Materialized View Selection Using Simulated Annealing , 2012, BDA.

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

[36]  T. V. Vijay Kumar,et al.  Materialized View Selection Using Genetic Algorithm , 2012, IC3.

[37]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[38]  Ziqiang Wang,et al.  An Efficient Materialized Views Selection Algorithm Based on PSO , 2009, 2009 International Workshop on Intelligent Systems and Applications.

[39]  Karthik Ramachandran,et al.  A Hybrid Approach for Data Warehouse View Selection , 2006, Int. J. Data Warehous. Min..

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

[41]  Ziqiang Wang,et al.  An Efficient MA-Based Materialized Views Selection Algorithm , 2009, 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009).

[42]  Ziyu Lin,et al.  User-Oriented Materialized View Selection , 2007, 7th IEEE International Conference on Computer and Information Technology (CIT 2007).

[43]  T. V. Vijay Kumar,et al.  Materialised views selection using size and query frequency , 2011 .

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

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

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

[47]  T. V. Vijay Kumar,et al.  Materialized Views Selection for Answering Queries , 2010, ICDEM.

[48]  Ender Özcan,et al.  Memetic Algorithms for Parallel Code Optimization , 2004, International Journal of Parallel Programming.

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

[50]  Nagwa M. El-Makky,et al.  Algorithms for selecting materialized views in a data warehouse , 2005, The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005..

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