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

In distributed database systems, commit protocols are used to ensure t he transaction atomicity. In the presence of failures, nonblocking com mit protocols can guarantee the transaction atomicity without blocking the transaction execution. A (resilient) decentralized nonblocking co mmit protocol (RDCP) is proper-ed for distributed database systems. Th is protocol is based on the hypercube network topology and is 'liub(lo g(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)) wh ich is only a factor of log(2)(N) over the message complexity lower bo und 0(N.log(2)(N)) of decentralized commit protocols. Furthermore, RDC P is an optimistic nonblocking protocol. It aborts the transaction onl y when some nodes want to abort or some nodes fail before they make lo cal decisions.