A NEW DYNAMIC COORDINATORS SELECTION ALGORITHM IN DISTRIBUTED DATABASE SYSTEMS

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.

[1]  Bruce G. Lindsay,et al.  Transaction management in the R* distributed database management system , 1986, TODS.

[2]  Butler W. Lampson,et al.  A New Presumed Commit Optimization for Two Phase Commit , 1993, VLDB.

[3]  Kenneth Salem,et al.  The Presumed-Either Two-Phase Commit Protocol , 2002, IEEE Trans. Knowl. Data Eng..

[4]  Panos K. Chrysanthis,et al.  Enhancing the performance of presumed commit protocol , 1997, SAC '97.

[5]  Sanny Gustavsson.  On recovery and consistency preservation in distributed real-time database systems , 2000 .

[6]  Marc Suñé Clos.  A framework for network traffic analysis using GPUs , 2010 .

[7]  Jeffrey D. Case,et al.  Simple network management protocol , 1995 .

[8]  Wanlei Zhou,et al.  Replication Techniques in Distributed Systems , 1999, Scalable Comput. Pract. Exp..

[9]  Johnny S. K. Wong,et al.  A nonblocking timed atomic commit protocol for distributed real-time database systems , 1996, J. Syst. Softw..

[10]  Ghazi Alkhatib,et al.  Transaction Management in Distributed Database Systems: The Case of Oracle's Two-Phase Commit , 2002, J. Inf. Syst. Educ..

[11]  Jayant R. Haritsa,et al.  MIRROR: a state-conscious concurrency control protocol for replicated real-time databases , 1999, Proceedings of International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems. (Cat. No.PR00334).

[12]  Bipin C. Desai,et al.  Performance of a two-phase commit protocol , 1996, Inf. Softw. Technol..

[13]  Ludek Matyska,et al.  Nonblocking Distributed Replication of Versioned Files , 2007, J. Softw..

[14]  Ahmad Sharieh,et al.  Leader Election Algorithm in 2D Torus Networks with the Presence of One Link Failure , 2010, Int. Arab J. Inf. Technol..

[15]  Jon M. Kleinberg,et al.  Detecting a Network Failure , 2004, Internet Math..

[16]  Panos K. Chrysanthis,et al.  1-2PC: the one-two phase atomic commit protocol , 2004, SAC '04.

[17]  Jon M. Kleinberg,et al.  Detecting a network failure , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .