Skip to main content
Top

2021 | OriginalPaper | Chapter

An Effective Hybrid Approach for Solving Prioritized Cube Selection Problem Using Particle Swarm Optimization and Tabu Search

Authors : Anjana Gosain, Heena Madaan

Published in: Progress in Advanced Computing and Intelligent Engineering

Publisher: Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Materialized view selection is a major challenge in data warehouse management, and prioritized cube selection is further approach to find an optimal set of prioritized cubes under resource constraints. In this paper, we introduce a hybrid approach combining particle swarm optimization (PSO) algorithm with tabu search (TS) to solve the prioritized cube selection problem. Our proposed hybrid algorithm deals with PSO’s premature convergence problem through integration of TS local neighbourhood search, and thus significantly improves the solution quality. We also present a neighbourhood reduction strategy based on cube information obtained during PSO search to intensify the search of TS for better solutions. Finally, we prove the effectiveness of our proposed hybrid algorithm for high-dimensional prioritized cube selection problem by comparing the results with PSO algorithm results.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Widom J (1995) Research problems in data warehouse. In: 4th international conferences on information knowledge management. Baltimore, Maryland, USA, pp 25–30 (1995) Widom J (1995) Research problems in data warehouse. In: 4th international conferences on information knowledge management. Baltimore, Maryland, USA, pp 25–30 (1995)
2.
go back to reference Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. ACM SIGMOD Record 25(2):205–216CrossRef Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. ACM SIGMOD Record 25(2):205–216CrossRef
3.
go back to reference Gupta H (1997) Selection of views to materialize in a data warehouse. In: ICDT. Springer, Berlin, Heidelberg, pp 98–112 Gupta H (1997) Selection of views to materialize in a data warehouse. In: ICDT. Springer, Berlin, Heidelberg, pp 98–112
4.
go back to reference Lin WY, Kuo IC (2004) A genetic selection algorithm for OLAP data cubes. Knowl Inf Syst 6(1):83–102CrossRef Lin WY, Kuo IC (2004) A genetic selection algorithm for OLAP data cubes. Knowl Inf Syst 6(1):83–102CrossRef
5.
go back to reference Gosain A, Madaan H (2016) Query prioritization for view selection. In: ICACNI’16. Springer, Singapore, pp 403–410 (2016) Gosain A, Madaan H (2016) Query prioritization for view selection. In: ICACNI’16. Springer, Singapore, pp 403–410 (2016)
6.
go back to reference Gosain A, Madaan H (2018) Efficient approach for view materialisation in a data warehouse by prioritising data cubes. IET Softw 12(6):498–506CrossRef Gosain A, Madaan H (2018) Efficient approach for view materialisation in a data warehouse by prioritising data cubes. IET Softw 12(6):498–506CrossRef
7.
go back to reference Kokash N (2005) An introduction to heuristic algorithms. Department of Informatics and Telecommunications (2005) Kokash N (2005) An introduction to heuristic algorithms. Department of Informatics and Telecommunications (2005)
8.
go back to reference 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–294CrossRef 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–294CrossRef
9.
go back to reference Loureiro J, Belo O (2006) A discrete particle swarm algorithm for OLAP data cube selection. ICEIS Paphos Cyprus: 46–62 Loureiro J, Belo O (2006) A discrete particle swarm algorithm for OLAP data cube selection. ICEIS Paphos Cyprus: 46–62
10.
go back to reference Kumar TV, Kumar S (2012) Materialized view selection using simulated annealing. In: International conference on big data analytics. Springer, Berlin, Heidelberg, pp 168–179 (2012) Kumar TV, Kumar S (2012) Materialized view selection using simulated annealing. In: International conference on big data analytics. Springer, Berlin, Heidelberg, pp 168–179 (2012)
12.
go back to reference Kalivarapu V, Foo FL, Winer E (2009) Synchronous parallelization of particle swarm optimization with digital pheromones. Adv Eng Softw 40(10):975–985CrossRef Kalivarapu V, Foo FL, Winer E (2009) Synchronous parallelization of particle swarm optimization with digital pheromones. Adv Eng Softw 40(10):975–985CrossRef
13.
go back to reference Shinichi N, Ishigame A, Yasuda K (2007) Particle swarm optimization based on the concept of tabu search. In: IEEE congress on evolutionary computation. Singapore, pp 3258–3263 Shinichi N, Ishigame A, Yasuda K (2007) Particle swarm optimization based on the concept of tabu search. In: IEEE congress on evolutionary computation. Singapore, pp 3258–3263
14.
go back to reference Guohui Z, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56(4):1309–1318CrossRef Guohui Z, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56(4):1309–1318CrossRef
15.
go back to reference Gao H, Kwong S, Fan B, Wang R (2014) A hybrid particle-swarm tabu search algorithm for solving job shop scheduling problems. IEEE Trans Ind Inf 10(4):2044–2054CrossRef Gao H, Kwong S, Fan B, Wang R (2014) A hybrid particle-swarm tabu search algorithm for solving job shop scheduling problems. IEEE Trans Ind Inf 10(4):2044–2054CrossRef
16.
go back to reference Marinakis Y, Marinaki M, Dounias G (2010) A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng Appl Artif Intell 23(4):463–472CrossRef Marinakis Y, Marinaki M, Dounias G (2010) A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng Appl Artif Intell 23(4):463–472CrossRef
17.
go back to reference Shahnazari-Shahrezaei P, Tavakkoli-Moghaddam R, Kazemipoor H (2013) Solving a multi-objective multi-skilled manpower scheduling model by a fuzzy goal programming approach. Appl Math Model 37(7):5424–5443MathSciNetCrossRef Shahnazari-Shahrezaei P, Tavakkoli-Moghaddam R, Kazemipoor H (2013) Solving a multi-objective multi-skilled manpower scheduling model by a fuzzy goal programming approach. Appl Math Model 37(7):5424–5443MathSciNetCrossRef
18.
go back to reference Hadji HE, Babes M (2016) Integrating Tabu Search in Particle Swarm Optimization for the frequency assignment problem. China Commun 13(3):137–155CrossRef Hadji HE, Babes M (2016) Integrating Tabu Search in Particle Swarm Optimization for the frequency assignment problem. China Commun 13(3):137–155CrossRef
19.
go back to reference Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. Comput Cybern Simul: 4104–4108 Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. Comput Cybern Simul: 4104–4108
20.
go back to reference Nezamabadi-pour H, Rostami-Shahrbabaki M, Maghfoori-Farsangi M (2008) Binary particle swarm optimization: challenges and new solutions. CSI Comput Sci Eng 6(1):21–32 Nezamabadi-pour H, Rostami-Shahrbabaki M, Maghfoori-Farsangi M (2008) Binary particle swarm optimization: challenges and new solutions. CSI Comput Sci Eng 6(1):21–32
21.
go back to reference Gosain A (2016) Materialized cube selection using particle swarm optimization algorithm. Procedia Comput Sci 79:2–7CrossRef Gosain A (2016) Materialized cube selection using particle swarm optimization algorithm. Procedia Comput Sci 79:2–7CrossRef
22.
23.
go back to reference Lai X, Hao JK, Glover F, Lu Z (2018) A two-phase tabu-evolutionary algorithm for the 0–1 multidimensional knapsack problem. Inf Sci 436:282–301MathSciNetCrossRef Lai X, Hao JK, Glover F, Lu Z (2018) A two-phase tabu-evolutionary algorithm for the 0–1 multidimensional knapsack problem. Inf Sci 436:282–301MathSciNetCrossRef
24.
go back to reference Gendreau M, Potvin JY (2010) Tabu search. Handbook of metaheuristics. Springer, Berlin, pp 41–59CrossRef Gendreau M, Potvin JY (2010) Tabu search. Handbook of metaheuristics. Springer, Berlin, pp 41–59CrossRef
Metadata
Title
An Effective Hybrid Approach for Solving Prioritized Cube Selection Problem Using Particle Swarm Optimization and Tabu Search
Authors
Anjana Gosain
Heena Madaan
Copyright Year
2021
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-6584-7_34