An O(N log/sub 2//sup 2/N) fault-tolerant decentralized commit protocol

A new decentralized commit protocol is proposed for distributed database systems. This protocol can be applied to any size of systems and is (log/sub 2/N)-2 resilient to site failures where N is the number of sites in the system. In addition, the number of messages sent among N sites is O(N log/sub 2//sup 2/N) which is only a factor of log/sub 2/ N over the message complexity lower bound O(N ln N).<
>