DBScholar

Back to papers

A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols

Summary: Tight upper bound: if a single‑copy availability is A (0<A<1) then no mutual‑exclusion/consistency protocol in the same failure-prone network can exceed sqrt(A). Bound is tight for A>0.25; computing A is #P‑complete, but a practical dynamic approximation for single‑copy placement is given. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
925
Venue
PODS
Year
1991
Pagerank
5.093636e-05
Overall Rank
13,098 | 10.14%
DOI
10.1145/113413.113420

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{johnson_pods91,
        address = {New York, NY, USA},
        series = {{PODS} '91},
        title = {{A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols}},
        url = {https://dl.acm.org/doi/10.1145/113413.113420},
        doi = {10.1145/113413.113420},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Johnson, Donald B. and Raab, Larry},
        year = {1991}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,881 Dynamic Voting 1987 SIGMOD 8.0025526e-05
3,807 Availability in Partitioned Replicated Databases (Extended Abstract) 1986 PODS 7.1084437e-05
7,539 Enhancements to the Voting Algorithm 1987 VLDB 5.6029996e-05
Previous Page 1 / 1 Next

Semantically Similar Papers