REDUCING TRANSFER COSTS OF FRAGMENTS ALLOCATION IN REPLICATED DISTRIBUTED DATABASE USING GENETIC ALGORITHMS
 
More details
Hide details
1
Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran
Publication date: 2015-03-01
 
Adv. Sci. Technol. Res. J. 2015; 9(25):1–6
 
KEYWORDS
ABSTRACT
Distributed databases were developed in order to respond to the needs of distributed computing. Unlike traditional database systems, distributed database systems are a set of nodes that are connected with each other by network and each of nodes has its own database, but they are available by other systems. Thus, each node can have access to all data on entire network. The main objective of allocated algorithms is to attribute fragments to various nodes in order to reduce the shipping cost. Thus, firstly fragments of nodes must be accessible by all nodes in each period, secondly, the transmission cost of fragments to nodes must be reduced and thirdly, the cost of updating all components of nodes must be optimized, that results in increased reliability and availability of network. In this study, more efficient hybrid algorithm can be produced combining genetic algorithms and previous algorithms.