Epidemic algorithms in replicated databases

D. Agrawal, A. El Abbadi, R. C. Steinke

Research output: Contribution to conferencePaper

76 Citations (Scopus)

Abstract

We present a family of epidemic algorithms for maintaining replicated data in a transactional framework. 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 in which locks are released as soon as transactions finish their execution locally. However, this optimistic releasing of locks introduces the possibility of cascading aborts while ensuring serializable executions. The last member of this family of epidemic algorithms is motivated from the need for asynchronous replication solutions that are being increasingly used in commercial systems. The protocol 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.

Original languageEnglish
Pages161-172
Number of pages12
Publication statusPublished - 1 Jan 1997
EventProceedings of the 1997 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Tucson, AZ, USA
Duration: 12 May 199714 May 1997

Other

OtherProceedings of the 1997 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CityTucson, AZ, USA
Period12/5/9714/5/97

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Agrawal, D., El Abbadi, A., & Steinke, R. C. (1997). Epidemic algorithms in replicated databases. 161-172. Paper presented at Proceedings of the 1997 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, AZ, USA, .