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
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,778 | Dynamic Voting | 1987 | SIGMOD | 0.00010571415 |
| 2,444 | A Recovery Algorithm for a Distributed Database System | 1983 | PODS | 8.8014845e-05 |
| 2,459 | Bounded Ignorance in Replicated Systems | 1991 | PODS | 8.7527751e-05 |
| 2,683 | Epidemic Algorithms in Replicated Databases (Extended Abstract) | 1997 | PODS | 8.3164369e-05 |
| 3,272 | Rethinking Eventual Consistency | 2013 | SIGMOD | 7.290716e-05 |
| 3,710 | Updating Replicated Data During Communications Failures | 1985 | VLDB | 6.8201269e-05 |
| 5,171 | Using History Information to Process Delayed Database Updates | 1986 | VLDB | 5.6415662e-05 |
| 12,023 | Edelweiss: Automatic Storage Reclamation for Distributed Programming | 2014 | VLDB | 4.1905499e-05 |
| 12,982 | Reducing Storage for Quorum Consensus Algorithms | 1988 | VLDB | 4.1905499e-05 |
| 13,021 | A semantic approach to correctness of concurrent transaction executions | 1985 | PODS | 4.1905499e-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 |
|---|---|---|---|---|
| 346 | An Optimality Theory of Concurrency Control for Databases | 1979 | SIGMOD | 0.00026589144 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 961 | The Case for Determinism in Database Systems | 2010 | VLDB | 0.00015028453 |
| 797 | An Efficient, Fault-Tolerant Protocol For Replicated Data Management | 1985 | PODS | 0.00016521425 |
| 5,291 | Semantics Based Transaction Management Techniques for Replicated Data | 1988 | SIGMOD | 5.5786983e-05 |
| 1,995 | Fault-Tolerance in the Borealis Distributed Stream Processing System | 2005 | SIGMOD | 9.83817e-05 |
| 3,099 | An Efficient Scheme for Providing High Availability | 1992 | SIGMOD | 7.5676496e-05 |
| 1,295 | A Locking Protocol For Resource Coordination In Distributed Databases | 1978 | SIGMOD | 0.00012745933 |
| 3,272 | Rethinking Eventual Consistency | 2013 | SIGMOD | 7.290716e-05 |
| 1,418 | Highly Available Transactions: Virtues and Limitations | 2014 | VLDB | 0.00012082141 |
| 12,913 | A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols | 1991 | PODS | 4.1905499e-05 |
| 3,710 | Updating Replicated Data During Communications Failures | 1985 | VLDB | 6.8201269e-05 |