Performance optimality enhancement algorithm in DDBS (POEA).
Highlights: [•] A new dynamic data allocation algorithm for non-replicated DDBS (POEA) is presented. [•] POEA improves fragments reallocation to different sites. [•] POEA adopts the shortest path between the old location and the new anticipated location. [•] Experimental results show that POEA has e...
| Published in: | Computers in Human Behavior Vol. 30; pp. 419 - 427 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Published: |
Elsevier B.V.
Jan2014
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |
| Summary: | Highlights: [•] A new dynamic data allocation algorithm for non-replicated DDBS (POEA) is presented. [•] POEA improves fragments reallocation to different sites. [•] POEA adopts the shortest path between the old location and the new anticipated location. [•] Experimental results show that POEA has efficiently reduced the transmission cost. [•] Minimizes frequency and time spent on fragment migration over the network sites. |
|---|