Database Paper Browser

Back to papers

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)

Paper ID
612
Venue
PODS
Year
1982
Pagerank
0.00016652167
Overall Rank
787 | 94.53%
DOI
-

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.00010581287
2,442 A Recovery Algorithm for a Distributed Database System 1983 PODS 8.8099248e-05
2,461 Bounded Ignorance in Replicated Systems 1991 PODS 8.7602026e-05
2,679 Epidemic Algorithms in Replicated Databases (Extended Abstract) 1997 PODS 8.3246158e-05
3,274 Rethinking Eventual Consistency 2013 SIGMOD 7.2906895e-05
3,697 Updating Replicated Data During Communications Failures 1985 VLDB 6.8343437e-05
5,169 Using History Information to Process Delayed Database Updates 1986 VLDB 5.6486115e-05
12,015 Edelweiss: Automatic Storage Reclamation for Distributed Programming 2014 VLDB 4.1945683e-05
12,972 Reducing Storage for Quorum Consensus Algorithms 1988 VLDB 4.1945683e-05
13,010 A semantic approach to correctness of concurrent transaction executions 1985 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
347 An Optimality Theory of Concurrency Control for Databases 1979 SIGMOD 0.00026610677
Previous Page 1 / 1 Next

Semantically Similar Papers