Issue No. 05 - September/October (2003 vol. 15)
JoAnne Holliday , IEEE
Divyakant Agrawal , IEEE
Amr El Abbadi , IEEE
<p><b>Abstract</b>—We present a family of epidemic algorithms for maintaining replicated database systems. The algorithms are based on the causal delivery of log records where each record corresponds to one transaction instead of one operation. The first algorithm in this family is a pessimistic protocol that ensures serializability and guarantees strict executions. Since we expect the epidemic algorithms to be used in environments with low probability of conflicts among transactions, we develop a variant of the pessimistic algorithm which is optimistic in that transactions commit as soon as they terminate locally and inconsistencies are detected asynchronously as the effects of committed transactions propagate through the system. The last member of the family of epidemic algorithms is pessimistic and uses voting with quorums to resolve conflicts and improve transaction response time. A simulation study evaluates the performance of the protocols.</p>
Database replication, distributed databases, epidemic communication.
J. Holliday, A. El Abbadi, R. Steinke and D. Agrawal, "Epidemic Algorithms for Replicated Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 15, no. , pp. 1218-1238, 2003.