ABSTRACT

The key idea of this paper is to empirically evaluate the performance of the algorithm TTVDCA-RNR for dynamic data allocation in distributed database system (DDS). Distributed database system performance depends heavily on the allocation of data fragments at different sites. For improving the performance of distributed database system, this algorithm is working on the concept of dynamically placing the data at site(s) where it is most desirable. To study the efficiency of the algorithm TTVDCA-RNR over other similar algorithm, a sample distributed database is used. Comparative results prove that TTVDCA-RNR is more efficient algorithm and significantly improves the overall performance of the system.