Skip to main navigation Skip to search Skip to main content

A fault-tolerant algorithm for replicated data management

  • Sampath Rangarajan
  • , Sanjeev Setia
  • , Satish K. Tripathi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Scopus citations

Abstract

The problem of managing replicated copies of data in a distributed database is considered. Quorum consensus methods for managing replicated data require that an operation proceed only if a group of copies form a quorum. For example, in a majority voting scheme, for a write operation to proceed, a majority of the copies have to form a quorum. The authors first introduce a performance measure for measuring the performance of fault-tolerant algorithms for this problem. They then propose a quorum-based method which is highly fault tolerant and has a low message overhead. The algorithm can tradeoff fault tolerance for lower message overhead. The algorithm is compared to existing algorithms.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
PublisherPubl by IEEE
Pages230-237
Number of pages8
ISBN (Print)0818625457
StatePublished - Jan 1992
Event8th International Conference on Data Engineering - Tempe, AZ, USA
Duration: Feb 3 1992Feb 7 1992

Publication series

NameProceedings - International Conference on Data Engineering

Conference

Conference8th International Conference on Data Engineering
CityTempe, AZ, USA
Period02/3/9202/7/92

Fingerprint

Dive into the research topics of 'A fault-tolerant algorithm for replicated data management'. Together they form a unique fingerprint.

Cite this