Welcome to the InfoSci Platform
Reference Hub1
Distributed Query Plan Generation using Bacterial Foraging Optimization

Distributed Query Plan Generation using Bacterial Foraging Optimization

Jay Prakash, Neha Singh, T.V. Vijay Kumar
Copyright: © 2017 |Volume: 8 |Issue: 1 |Pages: 26
ISSN: 1947-8208|EISSN: 1947-8216|EISBN13: 9781522514114|DOI: 10.4018/IJKSS.2017010101
Cite Article Cite Article

MLA

Prakash, Jay, et al. "Distributed Query Plan Generation using Bacterial Foraging Optimization." IJKSS vol.8, no.1 2017: pp.1-26. http://doi.org/10.4018/IJKSS.2017010101

APA

Prakash, J., Singh, N., & Kumar, T. V. (2017). Distributed Query Plan Generation using Bacterial Foraging Optimization. International Journal of Knowledge and Systems Science (IJKSS), 8(1), 1-26. http://doi.org/10.4018/IJKSS.2017010101

Chicago

Prakash, Jay, Neha Singh, and T.V. Vijay Kumar. "Distributed Query Plan Generation using Bacterial Foraging Optimization," International Journal of Knowledge and Systems Science (IJKSS) 8, no.1: 1-26. http://doi.org/10.4018/IJKSS.2017010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In distributed database systems, relations are replicated and fragmented at multiple sites to ensure easy availability and greater reliability. This leads to an exponential increase in the possible alternatives available for selecting the set of sites, constituting a query plan, for processing. Computing the optimal query plans, from amongst all possible query plans, is a discrete combinatorial optimization problem. This Distributed Query Plan Generation (DQPG) problem has been addressed using Bacterial Foraging Optimization (BFO) in this paper. Here, a novel BFO based DQPG algorithm (DQPGBFO), which generates the Top-K distributed query plans having the minimum total query processing cost, has been proposed. Experimental comparison of DQPGBFO with the existing Genetic Algorithm (GA) based DQPG algorithm (DQPGGA) shows that the former is able to generate Top-K query plans that have a comparatively lower total cost of processing a distributed query. This, in turn, leads to a reduction in the query response time and thus aids in decision making.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.