Epidemic algorithms in replicated databases

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS
Editors Anon
Place of PublicationNew York, NY, United States
PublisherACM
Pages161-172
Number of pages12
Publication statusPublished - 1 Jan 1997
Externally publishedYes
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. In Anon (Ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS (pp. 161-172). New York, NY, United States: ACM.

Epidemic algorithms in replicated databases. / Agrawal, D.; El Abbadi, A.; Steinke, R. C.

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS. ed. / Anon. New York, NY, United States : ACM, 1997. p. 161-172.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Agrawal, D, El Abbadi, A & Steinke, RC 1997, Epidemic algorithms in replicated databases. in Anon (ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS. ACM, New York, NY, United States, pp. 161-172, Proceedings of the 1997 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, AZ, USA, 12/5/97.
Agrawal D, El Abbadi A, Steinke RC. Epidemic algorithms in replicated databases. In Anon, editor, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS. New York, NY, United States: ACM. 1997. p. 161-172
Agrawal, D. ; El Abbadi, A. ; Steinke, R. C. / Epidemic algorithms in replicated databases. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS. editor / Anon. New York, NY, United States : ACM, 1997. pp. 161-172
@inproceedings{ec171b522d824e599d2aa9237823bfcb,
title = "Epidemic algorithms in replicated databases",
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.",
author = "D. Agrawal and {El Abbadi}, A. and Steinke, {R. C.}",
year = "1997",
month = "1",
day = "1",
language = "English",
pages = "161--172",
editor = "Anon",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS",
publisher = "ACM",

}

TY - GEN

T1 - Epidemic algorithms in replicated databases

AU - Agrawal, D.

AU - El Abbadi, A.

AU - Steinke, R. C.

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030646721&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030646721&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030646721

SP - 161

EP - 172

BT - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - PODS

A2 - Anon, null

PB - ACM

CY - New York, NY, United States

ER -