Dynamic horizontal fragmentation, replication and allocation model in DDBSs

Distributed processing is an effective way to improve performance of database systems. Therefore, fragmentation and proper allocation of fragments across various sites of the network is considered as a key research area in distributed database environment. However, the issue of allocating fragments to the most appropriate sites is not an easy task to perform. In this paper, a synchronized horizontal fragmentation, replication and allocation model in the context of relational database is proposed. A heuristic technique to satisfy horizontal fragmentation and allocation using a cost model to minimize the total cost of distribution is developed. Experimental results are consistent with the hypothesis confirming that the proposed model can efficiently solve dynamic fragmentation and allocation problem in a distributed relational database systems.