Modeling View Selection as a Constraint Satisfaction Problem

Using materialized views can highly speed up the query processing time. This paper deals with the view selection issue, which consists in finding a set of views to materialize that minimizes the expected cost of evaluating the query workload, given a limited amount of resource such as total view maintenance cost and/or storage space. However, the solution space is huge since it entails a large number of possible combinations of views. For this matter, we have designed a solution involving constraint programming, which has proven to be a powerful approach for modeling and solving combinatorial problems. The efficiency of our method is evaluated using workloads consisting of queries over the schema of the TPC-H benchmark. We show experimentally that our approach provides an improvement in the solution quality (i.e., the quality of the obtained set of materialized views) in term of cost saving compared to genetic algorithm in limited time. Furthermore, our approach scales well with the query workload size.

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

[2]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

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

[4]  Pascal Van Hentenryck,et al.  Solving Large Combinatorial Problems in Logic Programming , 1990, J. Log. Program..

[5]  Minsoo Lee,et al.  Speeding Up Materialized View Selection in Data Warehouses Using a Randomized Algorithm , 2001, Int. J. Cooperative Inf. Syst..

[6]  Klemens Böhm,et al.  Towards materialized view selection for distributed databases , 2009, EDBT '09.

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

[8]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[9]  Mark Wallace,et al.  Practical applications of constraint programming , 2004, Constraints.

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

[11]  KarlapalemKamalakar,et al.  View relevance driven materialized view selection in data warehousing environment , 2002 .

[12]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

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

[14]  Bela Stantic,et al.  Simulated Annealing for Materialized View Selection in Data Warehousing Environment , 2006, Databases and Applications.

[15]  Wilburt Labio,et al.  Physical database design for data warehouses , 1997, Proceedings 13th International Conference on Data Engineering.

[16]  Jian Yang,et al.  Genetic Algorithm for Materialized View Selection in Data Warehouse Environments , 1999, DaWaK.

[17]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

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

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

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[23]  Prasan Roy,et al.  Efficient and extensible algorithms for multi query optimization , 1999, SIGMOD '00.

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

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

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

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

[28]  Mohamed Ziauddin,et al.  Materialized Views in Oracle , 1998, VLDB.

[29]  Olivier Roussel,et al.  Promoting robust black-box solvers through competitions , 2010, Constraints.

[30]  Malcolm P. Atkinson,et al.  Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java , 1999, ICDT.

[31]  Xin Yao,et al.  Materialized view selection as constrained evolutionary optimization , 2003, IEEE Trans. Syst. Man Cybern. Part C.

[32]  Bela Stantic,et al.  Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments , 2008, ICA3PP.

[33]  Krithi Ramamritham,et al.  Materialized view selection and maintenance using multi-query optimization , 2000, SIGMOD '01.