返回
A new approach based on particle swarm optimization algorithm for solving data allocation problem
DOI:10.1016/j.asoc.2017.11.019.png)
摘要
En 中文
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.
Keyword:
Data allocation problem
Particle swarm optimization
Distributed databases system
Site-fragment dependency
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Risks of treated anxiety, depression, and insomnia among nurses: A nationwide longitudinal cohort study
PLOS ONE
IF0
A robust approach for multi-agent natural resource allocation based on stochastic optimization algorithms基于随机优化算法的多agent自然资源鲁棒分配方法

