Transaction commitment at minimal communication cost

Authors:
A. Segall;O. Wolfson
Affiliations:
The Technion - Israel Institute of Technology, Haifa 32000, Israel;The Technion - Israel Institute of Technology, Haifa 32000, Israel
Venue:
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1987

Citing 9
Cited 3

Distributed databases principles and systems

Distributed databases principles and systems
Transaction commit in a realistic fault model

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
On the complexity of commit protocols

PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Graph Algorithms

Graph Algorithms
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
The inherent cost of nonblocking commitment

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Patterns of communication in consensus protocols

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

A hundred impossibility proofs for distributed computing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
The multicast policy and its relationship to replicated data placement

ACM Transactions on Database Systems (TODS)
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the communication protocol for transaction commitment in a distributed database. Specifically, the connection between the structure of communication among the participating sites, and the communication network topology is investigated. In order to do so, the cost of transaction commitment is defined as the number of network hops that messages of the protocol must traverse. We establish the necessary cost for transaction commitment, and show that it is also sufficient. A simple distributed algorithm is presented to prove sufficiency. Our algorithm is also time-efficient, and in order to prove that we show that the timing of our algorithm is optimal within a natural class of commit-protocols.