A new approach based on particle swarm optimization algorithm for solving data allocation problem
Küçük Resim Yok
Tarih
2018
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
ELSEVIER
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The effectiveness distributed database systems highly depends on the state of site that its task is to allocate fragments. This allocation purpose is performed for obtaining the minimum execute time and transaction cost of queries. There are some NP-hard problems that Data Allocation Problem (DAP) is one of them and solving this problem by means of enumeration method can be computationally expensive. Recently heuristic algorithms have been used to achieve desirable solutions. Due to fewer control parameters, robustness, speed convergence characteristics and easy adaptation to the problem, this paper propose a novel method based on Particle Swarm Optimization (PSO) algorithm which is suitable to minimize the total transmission cost for both the each site - fragment dependency and the each inter - fragment dependency. The core of the study is to solve DAP by utilizing and adaptation PSO algorithm, PSO-DAP for short. Allocation of fragments to the site has been done with PSO algorithm and its performance has been evaluated on 20 different test problems and compared with the state-of-art algorithms. Experimental results and comparisons demonstrate that proposed method generates better quality solutions in terms of execution time and total cost than compared state-of-art algorithms. (C) 2017 Elsevier B.V. All rights reserved.
Açıklama
Anahtar Kelimeler
Data allocation problem, Particle swarm optimization, Distributed databases system, Site-fragment dependency
Kaynak
APPLIED SOFT COMPUTING
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
62
