Title: Join query optimisation in the distributed databases using a hybrid harmony search and artificial bee colony algorithm

Authors: Manizheh Yazdani; Nima Jafari Navimipour

Addresses: Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran ' Future Technology Research Center, National Yunlin University of Science and Technology, 123 University Road, Section 3, Douliou, Yunlin 64002, Taiwan; Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran

Abstract: The query optimiser is a vital part of any distributed database mechanism. Reducing the execution period of the query depends on reaching an ideal query execution plan. Due to this issue's NP-hard nature, a hybrid harmony search and an artificial bee colony algorithm can be useful. The harmony is used to call query plans and signify them by S-dimension real vectors. A harmony memory is a place for creating and storing a primary population of harmony vectors. Then, bees explore harmony memory as a food source. The production of a novel nominate harmony out of all query plans in the harmony memory requires a pitch adjustment principle, a memory consideration one, and a random re-initialisation. Lastly, the new candidate vector replaces the worst harmony vector when it works better. The simulation outcomes have indicated that the introduced method reduces the expenses of evaluating a query compared to the harmony search and bee colony optimisation algorithms. However, this method has a longer execution time.

Keywords: distributed database system; join query optimisation; harmony search algorithm; artificial bee colony.

DOI: 10.1504/IJBIC.2021.114883

International Journal of Bio-Inspired Computation, 2021 Vol.17 No.3, pp.189 - 198

Accepted: 27 Oct 2020
Published online: 10 May 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article