Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network
Summary: Log- and clock-free replicated-dictionary algorithm that sacrifices serializability to achieve high availability under node failures and message loss/duplication. Defines history-dependent 'best-effort' weak-consistency tailored to dictionary ops, specifying behavior under partial failures. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael J. Fischer (Yale University)
- 2. Alan Michael (University of Wisconsin)
BibTeX Citation
@inproceedings{fischer_pods82,
address = {New York, NY, USA},
series = {{PODS} '82},
title = {{Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network}},
url = {https://dl.acm.org/doi/10.1145/588111.588124},
doi = {10.1145/588111.588124},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Fischer, Michael J. and Michael, Alan},
year = {1982}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,947 | Dynamic Voting | 1987 | SIGMOD | 7.8233382e-05 |
| 3,114 | Epidemic Algorithms in Replicated Databases (Extended Abstract) | 1997 | PODS | 7.6349852e-05 |
| 3,310 | Rethinking Eventual Consistency | 2013 | SIGMOD | 7.4405091e-05 |
| 3,885 | A Recovery Algorithm for a Distributed Database System | 1983 | PODS | 6.9466549e-05 |
| 4,096 | Bounded Ignorance in Replicated Systems | 1991 | PODS | 6.8094639e-05 |
| 4,697 | Updating Replicated Data During Communications Failures | 1985 | VLDB | 6.4646083e-05 |
| 6,675 | Using History Information to Process Delayed Database Updates | 1986 | VLDB | 5.7124558e-05 |
| 12,504 | Edelweiss: Automatic Storage Reclamation for Distributed Programming | 2014 | VLDB | 4.9793485e-05 |
| 13,459 | Reducing Storage for Quorum Consensus Algorithms | 1988 | VLDB | 4.9793485e-05 |
| 13,499 | A semantic approach to correctness of concurrent transaction executions | 1985 | PODS | 4.9793485e-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 |
|---|---|---|---|---|
| 711 | An Optimality Theory of Concurrency Control for Databases | 1979 | SIGMOD | 0.00014608112 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 781 | The Case for Determinism in Database Systems | 2010 | VLDB |
| 2 | 1,296 | An Efficient, Fault-Tolerant Protocol For Replicated Data Management | 1985 | PODS |
| 3 | 6,050 | Semantics Based Transaction Management Techniques for Replicated Data | 1988 | SIGMOD |
| 4 | 1,828 | Fault-Tolerance in the Borealis Distributed Stream Processing System | 2005 | SIGMOD |
| 5 | 4,092 | An Efficient Scheme for Providing High Availability | 1992 | SIGMOD |
| 6 | 2,352 | A Locking Protocol For Resource Coordination In Distributed Databases | 1978 | SIGMOD |
| 7 | 3,310 | Rethinking Eventual Consistency | 2013 | SIGMOD |
| 8 | 1,194 | Highly Available Transactions: Virtues and Limitations | 2014 | VLDB |
| 9 | 13,388 | A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols | 1991 | PODS |
| 10 | 4,697 | Updating Replicated Data During Communications Failures | 1985 | VLDB |