Two-Phase Commit in Gigabit-Networked Distributed Databases

In the future, diierent database sites will be interconnected via gigabit networks, forming a very powerful distributed database system. In such an environment, the propagation latency will be the dominant component of the overall communication cost while the migration of large amount of data will not pose a problem. Furthermore , computer systems are expected to become highly reliable. In this paper, we present a two-phase commit variant that exploits these new domain characteristics to minimize the cost of distributed transaction commitment. Although the protocol trades oo eeciency during normal processing for slower recovery, it supports forward recovery that potentially reduces the overall cost of recovery.

[1]  Flaviu Cristian,et al.  A low-cost atomic commit protocol , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.

[2]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[3]  Leonard Kleinrock The LatencylBandwidth Tradeoff in Gicrabit Networks , 1992 .

[4]  Flaviu Cristian,et al.  Coordinator log transaction execution protocol , 2005, Distributed and Parallel Databases.

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

[6]  Hamid Pirahesh,et al.  ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging , 1998 .

[7]  Michael Stonebraker,et al.  Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres , 1979, IEEE Transactions on Software Engineering.

[8]  Sujata Banerjee,et al.  Data sharing and recovery in gigabit-networked databases , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.