An optimal voting scheme for minimizing the overall communication cost in replicated data management

DOI10.1006/jpdc.1996.0072zbMath0855.68029OpenAlexW2093854984MaRDI QIDQ1923392

Xuemin Lin, Maria E. Orlowska

Publication date: 25 November 1996

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6981a91c4f276b77e7edfc97783f0206d3476919

zbMATH Keywords

distributed databasequorum consensus methods

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

A fully distributed quorum consensus method with high fault-tolerance and low communication overhead ⋮ A highly fault-tolerant quorum consensus method for managing replicated data

This page was built for publication: An optimal voting scheme for minimizing the overall communication cost in replicated data management