IDEAS home Printed from https://ideas.repec.org/a/igg/jkss00/v8y2017i1p1-26.html
   My bibliography  Save this article

Distributed Query Plan Generation using Bacterial Foraging Optimization

Author

Listed:
  • Jay Prakash

    (School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India)

  • Neha Singh

    (School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India)

  • T.V. Vijay Kumar

    (School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India)

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.

Suggested Citation

  • Jay Prakash & Neha Singh & T.V. Vijay Kumar, 2017. "Distributed Query Plan Generation using Bacterial Foraging Optimization," International Journal of Knowledge and Systems Science (IJKSS), IGI Global, vol. 8(1), pages 1-26, January.
    • Handle: RePEc:igg:jkss00:v:8:y:2017:i:1:p:1-26
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJKSS.2017010101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jkss00:v:8:y:2017:i:1:p:1-26. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.