Please use this identifier to cite or link to this item:
Title: A new approach based on greedy minimizing algorithm for solving data allocation problem
Authors: Mahi, Mostafa
Baykan, Ömer Kaan
Kodaz, Halife
Keywords: Data allocation problem
Greedy algorithm
Particle swarm optimization
Distributed databases system
Site-fragment dependency
Particle Swarm Optimization
Ant Colony Optimization
Genetic Algorithm
Issue Date: 2023
Publisher: Springer
Abstract: Distributed database functionality depends on sites responsible for the allocation of fragments. The aims of the data allocation problem (DAP) are to achieve the minimum execution time and ensure the lowest transaction cost of queries. The solution for this NP-hard problem based on numerical methods is computationally expensive. Despite the success of such heuristic algorithms as GA and PSO in solving DAP, the initial control parameters tuning, the relatively high convergence speed, and hard adaptations to the problem are the most important disadvantages of these methods. This paper presents a simple well-formed greedy algorithm to optimize the total transmission cost of each site-fragment dependency and each inner-fragment dependency. To evaluate the effect of the proposed method, more than 20 standard DAP problems were used. Experimental results showed that the proposed approach had better quality in terms of execution time and total cost.
ISSN: 1432-7643
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collections

Files in This Item:
File SizeFormat 
  Until 2030-01-01
1.62 MBAdobe PDFView/Open    Request a copy
Show full item record

CORE Recommender

Page view(s)

checked on Sep 18, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.