A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Introduction to a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Reliability mechanisms for SDD-1: a system for distributed databases
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
LOCUS a network transparent, high reliability distributed system
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Read-only transactions in a distributed database
Read-only transactions in a distributed database
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Correctness conditions for highly available replicated databases
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Concurrency versus availability: atomicity mechanisms for replicated data
ACM Transactions on Computer Systems (TOCS)
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Specifying graceful degradation in distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Issues and approaches to design of real-time database systems
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
An Overview of the Nexus Distributed Operating System Design
IEEE Transactions on Software Engineering
Concurrency and availability as dual properties of replicated atomic data
Journal of the ACM (JACM)
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
The five color concurrency control protocol: non-two-phase locking in general databases
ACM Transactions on Database Systems (TODS)
Lazy replication: exploiting the semantics of distributed services
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Stability, Availability, and Response in Network File Service
IEEE Transactions on Software Engineering
Bounded ignorance in replicated systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Lazy replication: exploiting the semantics of distributed services (extended abstract)
ACM SIGOPS Operating Systems Review
Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
Propagation of authorizations in distributed database systems
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
Eventually-serializable data services
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Epidemic algorithms in replicated databases (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The Bengal Database Replication System
Distributed and Parallel Databases
Lazy replication: exploiting the semantics of distributed services
EW 4 Proceedings of the 4th workshop on ACM SIGOPS European workshop
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Logical Time in Distributed Software Systems
Programming and Computing Software
Storage Efficient Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Specifying Graceful Degradation
IEEE Transactions on Parallel and Distributed Systems
A Nonblocking Quorum Consensus Protocol for Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Efficient Execution of Read-Only Transactions in Replicated Multiversion Databases
IEEE Transactions on Knowledge and Data Engineering
Using History Information to Process Delayed Database Updates
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Reducing Storage for Quorum Consensus Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Preserving Causality in a Scalable Message-Oriented Middleware
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
View Divergence Control of Replicated Data Using Update Delay Estimation
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
ACM Computing Surveys (CSUR)
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Updating replicated data during communications failures
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Models and software model checking of a distributed file replication system
Formal methods and hybrid real-time systems
Replicated abstract data types: Building blocks for collaborative applications
Journal of Parallel and Distributed Computing
Rethinking eventual consistency
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
We present a simple algorithm for maintaining a replicated distributed dictionary which achieves high availability of data, rapid processing of atomic actions, efficient utilization of storage, and tolerance to node or network failures including lost or duplicated messages. It does not require transaction logs, synchronized clocks, or other complicated mechanisms for its operation. It achieves consistency contraints which are considerably weaker than serial consistency but nonetheless are adequate for many dictionary applications such as electronic appointment calendars and mail systems. The degree of consistency achieved depends on the particular history of operation of the system in a way that is intuitive and easily understood. The algorithm implements a "best effort" approximation to full serial consistency, relative to whatever internode communication has successfully taken place, so the semantics are fully specified even under partial failure of the system. Both the correctness of the algorithm and the utility of such weak semantics depend heavily on special properties of the dictionary operations.