A LIUB(LOG(2)(N))-2 RESILIENT DECENTRALIZED COMMIT PROTOCOL

Abstract

In distributed database systems, commit protocols are used to ensure the transaction atomicity. In the presence of failures, nonblocking commit protocols can guarantee the transaction atomicity without blocking the transaction execution. A (resilient) decentralized nonblocking commit protocol (RDCP) is proper-ed for distributed database systems. This protocol is based on the hypercube network topology and is 'liub(log(2)(N)) - 2' resilient to node failures (N = number of system-nodes). The number of messages sent among the N nodes is 0(N.log(2)(2)(N)) which is only a factor of log(2)(N) over the message complexity lower bound 0(N.log(2)(N)) of decentralized commit protocols. Furthermore, RDCP is an optimistic nonblocking protocol. It aborts the transaction only when some nodes want to abort or some nodes fail before they make local decisions.