• A NEW DYNAMIC COORDINATORS SELECTION ALGORITHM IN DISTRIBUTED DATABASE SYSTEMS

Abstract

Distributed database management systems (DDBMSs) pose different problems when accessing distributed and replicated databases. Particularly, access control and transaction management in DDBS require different mechanism to monitor data retrieval and update to databases. Current trends in multi-tier client/server networks make DDBMS an appropriate solution to provide access to and control over localized databases. One of the basic problems in DDBMS is two phase commit protocol that depends on one coordinator which responsible for executing the transaction to other participant in the network. In this paper we present a new algorithm in order to select dynamically more than one coordinator and sort them according to their availability in any arbitrary network. The proposed algorithm is applied and showed the improvement of the DDBMS in any communication network.