Nonreplicated Static Data Allocation in Distributed Databases Using Biogeography-Based Optimization

  • Singh A
  • Kahlon K
  • Virk R
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Allocation of data is one of the key design issues of distributed database. A major cost of query execution in a distributed database system is the data transfer cost from one site to another site. The allocation of fragments among the different sites over the network plays an important role in performance of the distributed database system. The main objective of a data allocation in distributed database is to place the data fragments at different sites in such a way, so that the total data transfer cost can be minimized while executing a set of queries. In this paper, a new biogeography-based optimization (BBO) algorithm has been used to allocate the fragments during the design of distributed database system. The goal of this paper is to design a fragments allocation algorithm, so that the total data transmission cost can be minimized. To show the performance of proposed algorithm, results of biogeography-based optimization algorithm for data allocation are compared with genetic algorithm.

Cite

CITATION STYLE

APA

Singh, A., Kahlon, K. S., & Virk, R. S. (2014). Nonreplicated Static Data Allocation in Distributed Databases Using Biogeography-Based Optimization. Chinese Journal of Engineering, 2014, 1–9. https://doi.org/10.1155/2014/785321

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free