Non-Redundant Dynamic Fragment Allocation with Horizontal Partition in Distributed Database System

Abstract

The main task of distributed database is how to fragment the global database into small fragments, how to allocate and replicate the fragments among different sites over the network. The performance of the distributed database system can be increased according to the best way of fragmentation, allocation and replication. Dynamic fragment allocation technique provides many environments where access patterns of different sites from multiple locations made to fragment change over time. This paper proposes an approach for non-redundant dynamic fragment allocation in distributed database system which additionally modified read and write data volume factor to Threshold Time Volume and Distance Constraints Algorithm. The proposed approach reallocates fragments with respect to the access patterns made to each fragments with amount of data volume up to time constraint and threshold value. The write data volume has to be considered for relocation process when more than one site simultaneously qualifies for the fragment. This algorithm will improve the overall of distributed database system performance.