A new efficient decentralized commit protocol is proposed for distribu
ted database systems. This protocol can be applied to systems of all s
izes and is [log(2) N] - 2 resilient to site failures, where N is the
number of sites in the system. In addition, the number of messages sen
t among the N sites is (N log(2)(2)N) which is only a factor of log(2)
over the message complexity lower bound O(N In N) of decentralized co
mmit protocols.