Abstract
SummaryAs the main factor in the distributed database systems, query optimization is aimed at finding an optimal execution plan to reduce the runtime. In such systems, because of the repeated relations on various sites, the query optimization is very challenging. Moreover, the query optimization issue with large‐scale distributed databases is an NP‐hard problem. Therefore, in this paper, an Artificial Bee Colony Algorithm based on Genetic Operators (ABC‐GO) is proposed to find a solution to join the query optimization problems in the distributed database systems. The ABC algorithm has the global–local search capabilities and genetic operators to create new candidate solutions for improving the performance of the ABC algorithm. The obtained results have shown that the cost of the query evaluation is minimized and the quality of Top‐K query plans is improved for a given distributed query. Moreover, this method decreases the overhead. However, it needs a longer execution time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
