Abstract
Materialized view selection problem is a NP-hard, constrained optimization problem where the pre-computation of views is censorious for query performance enhancement and expediting the data warehouse tasks. The pervasive presence of disk space and cost constraints heightens the intricacy of constrained optimization Materialized view selection (MVS) problem. Thus, the problem of MVS becomes prominent among data warehouse researchers. In the last few years, various evolutionary algorithms (EA) have been applied for the optimal selection of views. The present study handles the MVS problem using Ensembled Constraint Handling Techniques (ECHT) composed of (i) Self Adaptive Penalty (SP), (ii) ℇ- Constraint (EC) and (iii) Stochastic Ranking (SR) integrated with Differential Evolution (DE) algorithm. Authors have used TPC-H star schema benchmark dataset for testing. Simulated results were compared with three existing work i.e. PSO, genetic algorithm and EA and it was observed that our proposed ensemble method ECHTDEMVS, outperforms than single constraint handling methods and minimizes the total processing cost of query and is scalable.
Similar content being viewed by others
References
Bezdek, J.C. (2001) What is computational intelligence? In computational intelligence imitating life. NY: IEEE Press, 1994, pg. 1–12.
Biswas Partha P, Suganthan PN, Mallipeddi R, Amaratunga Gehan AJ (2018) Optimal power flow solutions using differential evolution algorithm integrated with effective constraint handling techniques. Eng Appl Artif Intell Vol.68, pg. 81–100.
Boukra A, Nacer MA, Bouroubi S (2007) Selection of views to materialize in data warehouse: a hybrid solution. Int J Comput Intell Res 3(4):327–334
Chaudhuri S, Dayal U (1997) An overview of data warehousing and OLAP technology. ACM SIGMOD Rec 26(1):65–74
Coello Carlos AC (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. In: Computer Methods in Applied Mechanics and Engineering, Elsevier, pg. 1245–1287
Coello Carlos AC (2012) Constraint-handling techniques used with evolutionary algorithms. In: Genetic and evolutionary computation conference GECCO’12, ACM
Farmani R, Wright JA (2003) Self-adaptive fitness formulation for constrained optimization. IEEE Trans Evol Comput 7(5):445–455
Golfarelli M, Maniezzo V, Rizzi S (2004) Materialization of fragmented views in multidimensional databases. Data Knowl Eng49, pg 325–335.
Gosain A, Heena (2016) Materialized cube selection using particle swarm optimization algorithm. In: 7th International Conference on Communication, Computing and Virtualization, Elsevier, Vol.79, pg. 2–7
Goswami R, Bhattacharyya DK, Dutta M (2013). Multiobjective differential evolution algorithm using binary encoded data in selecting views for materializing in data warehouse. International Conference on Swarm, Evolutionary, and Memetic Computing, SEMCCO 2013: Swarm, Evolutionary, and Memetic Computing, LNCS, volume 8298, pp. 95–106
Gray J, Layman A, Bosworth A, Pirahesh H (1997) Data cube: a relational aggregation operator generalizing group-by, cross-tabs and subtotals. In Data Min Knowl Disc, Vol.1, Issue.1, pg. 29–53.
Gupta H (1997) Selection of views to materialize in a data warehouse. In: Proceedings of the 6th International Conference on Database Theory, Springer-Verlag, pg.98–112
Gupta H, Mumick IS (1999) Selection of views to materialize under a maintenance cost constraint. In: Proceedings of the 7th International Conference on Database Theory, Springer-Verlag, 453–470
Gupta H, Mumick IS (2005) Selection of views to materialize in a data warehouse. In IEEE Trans Knowl Data Eng, Vol.17, No.1, pg. 24–43.
Gupta H, Harinarayan V, Rajaraman A, Ullman JD (1997) Index selection for OLAP. In: Proceedings of 13th International Conference on Data Engineering, pg. 208–219
Han J, Pei J, Kamber M (2001) Data mining: concepts and techniques. Morgan Kaufman Publishers, San Francisco
Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. In: Proceedings of the 1996 ACM SIGMOD international conference on Management of Data, Montreal, Que., Canada, pg. 205–216.
He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell Elsevier, 127 pg. 57–85.
Hung MC, Huang ML, Yang DL, Hsueh NL (2007) Efficient approaches for materialized views selection in a data warehouse. Inf Sci Elsevier, Vol.177, Issue.6, pg.1333–1348.
Inmon WH, Kelley C (1993) Rdb-VMS: developing a data warehouse. John Wiley & Sons, Inc
Jain H, Gosain A (2012) A comprehensive study of view maintenance approaches in data warehousing evolution. ACM SIGSOFT Softw Eng Notes 37(5):1–8
Kumar Vijay TV, Kumar S (2014) Materialized view selection using differential evolution. Int J Innov Comput Appl 6(2):102–113
Lee M, Hammer J (2001) Speeding up materialized view selection in data warehouses using a randomized algorithm. Int J Coop Inf Syst 10(3):327–353
Lin WY, Kuo IC (2004) A genetic selection algorithm for OLAP data cubes. Knowl Inf Syst Vol.6.1, pg. 83–102.
Mallipeddi R, Suganthan PN (2010) Ensemble of constraint handling techniques. IEEE Trans Evol Comput 14(4):561–579
Morse S, Isaac D (1998) Parallel Systems in the data warehouse. Prentice Hall, Upper saddle River
O’Neil P, O’Neil E, Chen X (2007) The star schema benchmark (SSB). Pat
Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417
Rauf M, Abdelmadjid B (2016) Using binary differential evolution to solve materialized views selection problem. International conference on business intelligence and applications (ICBIA) at: Blida Algeria
Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput Vol. 4, pg. 284–294.
Shukla A, Deshpande P, Naughton JF (1998) Materialized view selection for multidimensional datasets. In: Proceedings of 24th International Conference on Very Large Data Bases, pg. 488–499
Storn R, Price KD (1997) Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359
Takahama T, Sakai S (2006) Constrained optimization by the constrained differential evolution with gradient-based mutation and feasible elites. In: Proceedings of IEEE congress on evolutionary computation, Vancouver, BC, Canada, pg 1–8
Tessema BG, Yen GG (2006) A self-adaptive penalty function based algorithm for constrained optimization. In: IEEE Congress on Evolutionary Computation, 2006. CEC 2006. IEEE, pp 246–253
Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82
Xu Yu J, Yao X, Choi C H, Gou G, (2003) Materialized view selection as constrained evolutionary optimization. IEEE Trans Syst Man Cybern Part C Appl Rev, Vol. 33, No. 4, pg.458–467.
Yang J, Karlapalem K, Li Q (1997) Algorithms for materialized view design in data warehousing environment. In: VLDB, proceedings of the 23rd international conference on very large data bases Vol 97, pp 136–145
Zhang C, Yao X, Yang J (2001) An evolutionary approach to materialized views selection in a data warehouse environment. IEEE Trans Syst Man Cybern Part C Appl Rev 31(3):282–294
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Sachdeva, ., Gosain, A. Materialized view selection applying differential evolution algorithm combined with ensembled constraint handling techniques. Multimed Tools Appl 80, 31619–31645 (2021). https://doi.org/10.1007/s11042-021-11181-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-021-11181-8