@inproceedings{adb4b593973c4508a3b07da9e0bfb1eb,
title = "Optimizing voting-type algorithms for replicated data",
abstract = "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.",
author = "Akhil Kumar and Arie Segev",
note = "Publisher Copyright: {\textcopyright} 1988, Springer-Verlag.; 1st International Conference on Extending Database Technology, EDBT 1988 ; Conference date: 14-03-1988 Through 18-03-1988",
year = "1988",
doi = "10.1007/3-540-19074-0_66",
language = "English (US)",
isbn = "9783540190745",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "428--442",
editor = "Stefano Ceri and Schmidt, {Joachim W.} and Michele Missikoff",
booktitle = "Advances in Database Technology—EDBT 1988 - International Conference on Extending Database Technology, Proceedings",
address = "Germany",
}