Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/4305
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mahi, Mostafa | - |
dc.contributor.author | Baykan, Ömer Kaan | - |
dc.contributor.author | Kodaz, Halife | - |
dc.date.accessioned | 2023-08-03T19:00:09Z | - |
dc.date.available | 2023-08-03T19:00:09Z | - |
dc.date.issued | 2023 | - |
dc.identifier.issn | 1432-7643 | - |
dc.identifier.issn | 1433-7479 | - |
dc.identifier.uri | https://doi.org/10.1007/s00500-023-08452-x | - |
dc.identifier.uri | https://hdl.handle.net/20.500.13091/4305 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Soft Computing | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Data allocation problem | en_US |
dc.subject | Greedy algorithm | en_US |
dc.subject | Particle swarm optimization | en_US |
dc.subject | Distributed databases system | en_US |
dc.subject | Site-fragment dependency | en_US |
dc.subject | Particle Swarm Optimization | en_US |
dc.subject | Ant Colony Optimization | en_US |
dc.subject | Genetic Algorithm | en_US |
dc.subject | Databases | en_US |
dc.title | A new approach based on greedy minimizing algorithm for solving data allocation problem | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1007/s00500-023-08452-x | - |
dc.identifier.scopus | 2-s2.0-85160244048 | en_US |
dc.department | KTÜN | en_US |
dc.identifier.wos | WOS:000994160900012 | en_US |
dc.institutionauthor | … | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.authorscopusid | 36624030700 | - |
dc.authorscopusid | 23090480800 | - |
dc.authorscopusid | 8945093700 | - |
dc.identifier.scopusquality | Q1 | - |
item.grantfulltext | embargo_20300101 | - |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
crisitem.author.dept | 02.03. Department of Computer Engineering | - |
crisitem.author.dept | 02.03. Department of Computer Engineering | - |
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 | Size | Format | |
---|---|---|---|
s00500-023-08452-x.pdf Until 2030-01-01 | 1.62 MB | Adobe PDF | View/Open Request a copy |
CORE Recommender
Page view(s)
54
checked on May 6, 2024
Download(s)
4
checked on May 6, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.