Database Paper Browser

Back to papers

Enhancements To The Voting Algorithm

Summary: Enhances the classic voting replication scheme with primary-site voting, dynamic voting, and dynamic voting with linearly ordered copies; analyzes file availability under network partitioning. A stochastic model shows dynamic voting with linearly ordered copies yields the greatest availability among schemes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7822
Venue
VLDB
Year
1987
Pagerank
4.8925595e-05
Overall Rank
6,935 | 51.76%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,778 Dynamic Voting 1987 SIGMOD 0.00010581287
12,903 A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols 1991 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,778 Dynamic Voting 1987 SIGMOD 0.00010581287
Previous Page 1 / 1 Next

Semantically Similar Papers