.png){kind=icon}
.png){kind=icon}
Return
Performance optimality enhancement algorithm in DDBS (POEA)
.png){kind=icon}
PRE
AI
DOI：10.1016/j.chb.2013.04.026.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Proper data allocation is a key performance factor for an efficient functionality of Distributed Database Systems (DDBSs). Therefore, if data allocation across sites is performed accurately while preserving the issues of communication and site constraints, an optimal solution for DDBS performance in a dynamic distributed environment will be achieved. In this paper, a new dynamic data allocation algorithm for non-replicated DDBS is presented, the proposed Performance Optimality Enhancement Algorithm (POEA) explores and improves some concepts used in previously developed algorithms to reallocates fragments to different sites given the changing data access patterns, time and sites constraints of the DDBS. Moreover, the POEA adopts the shortest path between the old location and the new anticipated location for the transferred fragments when migration decision is made. Experimental results show that POEA has efficiently reduced the transmission cost subsequently minimizing the frequency and the time spent on fragment migration over the network sites resulting to a great improvement in the overall DDBS performance. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Allocation
DDBS
Fragment
Redistribution
Algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
9.0K
Citations:
5.8W