TY - GEN
T1 - Transaction Commitment at Minimal Communication Cost
AU - Segal, A.
AU - Wolfson, Ouri
N1 - Place of conference:USA
PY - 1987
Y1 - 1987
N2 - 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.
AB - 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.
UR - https://scholar.google.co.il/scholar?q=Transaction+Commitment+at+Minimal+Communication+Cost&btnG=&hl=en&as_sdt=0%2C5
M3 - Conference contribution
BT - Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PB - ACM
ER -