Optimizing voting-type algorithms for replicated data

Akhil Kumar, Arie Segev

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

5 Scopus citations


The main objectives of data replication are improved availability and reduced communications cost for queries. Maintaining the various copies consistent, however, increases the communications cost incurred by updates. For a given degree of replication, the choice of a specific concurrency control algorithm can have a significant impact on the total communications cost. In this paper we present various models for analyzing and understanding the trade-offs between the potentially opposing objectives of maximum resiliency and minimum communications cost in the context of the quorum consensus class of algorithms. It is argued that an optimal vote assignment is one which meets given resiliency goals and yet incurs the least communications cost compared with all other alternative assignments. A mathematical model for vote assignment is developed, and optimal algorithms are presented. It is demonstrated that significant cost savings can be realized from these approaches.

Original languageEnglish (US)
Title of host publicationAdvances in Database Technology—EDBT 1988 - International Conference on Extending Database Technology, Proceedings
EditorsStefano Ceri, Joachim W. Schmidt, Michele Missikoff
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540190745
StatePublished - 1988
Event1st International Conference on Extending Database Technology, EDBT 1988 - Venice, Italy
Duration: Mar 14 1988Mar 18 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume303 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other1st International Conference on Extending Database Technology, EDBT 1988

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Optimizing voting-type algorithms for replicated data'. Together they form a unique fingerprint.

Cite this