Skip to main content

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

  • Conference paper
  • First Online:
Progress in Advanced Computing and Intelligent Engineering

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1198))

  • 460 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Widom J (1995) Research problems in data warehouse. In: 4th international conferences on information knowledge management. Baltimore, Maryland, USA, pp 25–30 (1995)

    Google Scholar 

  2. Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. ACM SIGMOD Record 25(2):205–216

    Article  Google Scholar 

  3. Gupta H (1997) Selection of views to materialize in a data warehouse. In: ICDT. Springer, Berlin, Heidelberg, pp 98–112

    Google Scholar 

  4. Lin WY, Kuo IC (2004) A genetic selection algorithm for OLAP data cubes. Knowl Inf Syst 6(1):83–102

    Article  Google Scholar 

  5. Gosain A, Madaan H (2016) Query prioritization for view selection. In: ICACNI’16. Springer, Singapore, pp 403–410 (2016)

    Google Scholar 

  6. Gosain A, Madaan H (2018) Efficient approach for view materialisation in a data warehouse by prioritising data cubes. IET Softw 12(6):498–506

    Article  Google Scholar 

  7. Kokash N (2005) An introduction to heuristic algorithms. Department of Informatics and Telecommunications (2005)

    Google Scholar 

  8. 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

    Article  Google Scholar 

  9. Loureiro J, Belo O (2006) A discrete particle swarm algorithm for OLAP data cube selection. ICEIS Paphos Cyprus: 46–62

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Simulation and inverse modeling of semiconductor manufacturing processes. http://www.iue.tuwien.ac.at/phd/heitzinger/ (2002)

  12. Kalivarapu V, Foo FL, Winer E (2009) Synchronous parallelization of particle swarm optimization with digital pheromones. Adv Eng Softw 40(10):975–985

    Article  Google Scholar 

  13. 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

    Google Scholar 

  14. 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–1318

    Article  Google Scholar 

  15. 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–2054

    Article  Google Scholar 

  16. 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–472

    Article  Google Scholar 

  17. 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–5443

    Article  MathSciNet  Google Scholar 

  18. Hadji HE, Babes M (2016) Integrating Tabu Search in Particle Swarm Optimization for the frequency assignment problem. China Commun 13(3):137–155

    Article  Google Scholar 

  19. Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. Comput Cybern Simul: 4104–4108

    Google Scholar 

  20. 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

    Google Scholar 

  21. Gosain A (2016) Materialized cube selection using particle swarm optimization algorithm. Procedia Comput Sci 79:2–7

    Article  Google Scholar 

  22. Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74–94

    Article  Google Scholar 

  23. 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–301

    Article  MathSciNet  Google Scholar 

  24. Gendreau M, Potvin JY (2010) Tabu search. Handbook of metaheuristics. Springer, Berlin, pp 41–59

    Book  Google Scholar 

  25. Microsoft. Microsoft contoso BI demo dataset for retail industry. https://www.microsoft.com/en-in/download/details.aspx?id=18279 (2010)

  26. Microsoft. WideWorldImportersDW database catalog. https://docs.microsoft.com/en-us/sql/samples/wide-world-importers-dw-database-catalog?view=sql-server-2017 (2018)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Heena Madaan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gosain, A., Madaan, H. (2021). An Effective Hybrid Approach for Solving Prioritized Cube Selection Problem Using Particle Swarm Optimization and Tabu Search. In: Panigrahi, C.R., Pati, B., Mohapatra, P., Buyya, R., Li, KC. (eds) Progress in Advanced Computing and Intelligent Engineering. Advances in Intelligent Systems and Computing, vol 1198. Springer, Singapore. https://doi.org/10.1007/978-981-15-6584-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-6584-7_34

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-6583-0

  • Online ISBN: 978-981-15-6584-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics