Using broadcast primitives in replicated databases

I. Stanoi, D. Agrawal, A. El Abbadi

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

23 Citations (Scopus)

Abstract

We explore the use of different variants of broadcast protocols for managing replicated databases. Starting with the simplest broadcast primitive, the reliable broadcast protocol, we show how it can be used to ensure correct transaction execution. The protocol is simple, and has several advantages, including prevention of deadlocks. However, it requires a two-phase commitment protocol for ensuring correctness. We then develop a second protocol that uses causal broadcast and avoids the overhead of two-phase commit by exploiting the causal delivery properties of the broadcast primitives to implicitly collect the relevant information used in two-phase commit. Finally, we present a protocol that employs atomic broadcast and completely eliminates the need for acknowledgements during transaction commitment.

Original languageEnglish
Title of host publicationProceedings - International Conference on Distributed Computing Systems
EditorsM.P. Papazoglou, M. Takizawa, B. Kramer, S. Chanson
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages148-155
Number of pages8
Publication statusPublished - 1 Jan 1998
Externally publishedYes
EventProceedings of the 1998 18th International Conference on Distributed Computing Systems - Amsterdam, Neth
Duration: 26 May 199829 May 1998

Other

OtherProceedings of the 1998 18th International Conference on Distributed Computing Systems
CityAmsterdam, Neth
Period26/5/9829/5/98

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Stanoi, I., Agrawal, D., & El Abbadi, A. (1998). Using broadcast primitives in replicated databases. In M. P. Papazoglou, M. Takizawa, B. Kramer, & S. Chanson (Eds.), Proceedings - International Conference on Distributed Computing Systems (pp. 148-155). Piscataway, NJ, United States: IEEE.

Using broadcast primitives in replicated databases. / Stanoi, I.; Agrawal, D.; El Abbadi, A.

Proceedings - International Conference on Distributed Computing Systems. ed. / M.P. Papazoglou; M. Takizawa; B. Kramer; S. Chanson. Piscataway, NJ, United States : IEEE, 1998. p. 148-155.

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

Stanoi, I, Agrawal, D & El Abbadi, A 1998, Using broadcast primitives in replicated databases. in MP Papazoglou, M Takizawa, B Kramer & S Chanson (eds), Proceedings - International Conference on Distributed Computing Systems. IEEE, Piscataway, NJ, United States, pp. 148-155, Proceedings of the 1998 18th International Conference on Distributed Computing Systems, Amsterdam, Neth, 26/5/98.
Stanoi I, Agrawal D, El Abbadi A. Using broadcast primitives in replicated databases. In Papazoglou MP, Takizawa M, Kramer B, Chanson S, editors, Proceedings - International Conference on Distributed Computing Systems. Piscataway, NJ, United States: IEEE. 1998. p. 148-155
Stanoi, I. ; Agrawal, D. ; El Abbadi, A. / Using broadcast primitives in replicated databases. Proceedings - International Conference on Distributed Computing Systems. editor / M.P. Papazoglou ; M. Takizawa ; B. Kramer ; S. Chanson. Piscataway, NJ, United States : IEEE, 1998. pp. 148-155
@inproceedings{a183c1a61cae43f985f35fd9fe3417f0,
title = "Using broadcast primitives in replicated databases",
abstract = "We explore the use of different variants of broadcast protocols for managing replicated databases. Starting with the simplest broadcast primitive, the reliable broadcast protocol, we show how it can be used to ensure correct transaction execution. The protocol is simple, and has several advantages, including prevention of deadlocks. However, it requires a two-phase commitment protocol for ensuring correctness. We then develop a second protocol that uses causal broadcast and avoids the overhead of two-phase commit by exploiting the causal delivery properties of the broadcast primitives to implicitly collect the relevant information used in two-phase commit. Finally, we present a protocol that employs atomic broadcast and completely eliminates the need for acknowledgements during transaction commitment.",
author = "I. Stanoi and D. Agrawal and {El Abbadi}, A.",
year = "1998",
month = "1",
day = "1",
language = "English",
pages = "148--155",
editor = "M.P. Papazoglou and M. Takizawa and B. Kramer and S. Chanson",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "IEEE",

}

TY - GEN

T1 - Using broadcast primitives in replicated databases

AU - Stanoi, I.

AU - Agrawal, D.

AU - El Abbadi, A.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - We explore the use of different variants of broadcast protocols for managing replicated databases. Starting with the simplest broadcast primitive, the reliable broadcast protocol, we show how it can be used to ensure correct transaction execution. The protocol is simple, and has several advantages, including prevention of deadlocks. However, it requires a two-phase commitment protocol for ensuring correctness. We then develop a second protocol that uses causal broadcast and avoids the overhead of two-phase commit by exploiting the causal delivery properties of the broadcast primitives to implicitly collect the relevant information used in two-phase commit. Finally, we present a protocol that employs atomic broadcast and completely eliminates the need for acknowledgements during transaction commitment.

AB - We explore the use of different variants of broadcast protocols for managing replicated databases. Starting with the simplest broadcast primitive, the reliable broadcast protocol, we show how it can be used to ensure correct transaction execution. The protocol is simple, and has several advantages, including prevention of deadlocks. However, it requires a two-phase commitment protocol for ensuring correctness. We then develop a second protocol that uses causal broadcast and avoids the overhead of two-phase commit by exploiting the causal delivery properties of the broadcast primitives to implicitly collect the relevant information used in two-phase commit. Finally, we present a protocol that employs atomic broadcast and completely eliminates the need for acknowledgements during transaction commitment.

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

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

M3 - Conference contribution

AN - SCOPUS:0031638691

SP - 148

EP - 155

BT - Proceedings - International Conference on Distributed Computing Systems

A2 - Papazoglou, M.P.

A2 - Takizawa, M.

A2 - Kramer, B.

A2 - Chanson, S.

PB - IEEE

CY - Piscataway, NJ, United States

ER -