Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Increasing availability in partitioned database systems
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Sacrificing serializability to attain high availability of data in an unreliable network
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
| Hi-index | 0.00 |
In applications such as banking, reservation systems, inventory, and command and control it is desirable to allow updates to replicated data even during communications delays or failures. We present a technique that allows each site to process updates regardless of the state of the net- work -- to continue to update its own copy of the data and to process information about updates at other sites whenever it is available. Each site acts independently to revise its copy of the replicated data when it receives information about relevant updates. The process of merging newly received updates with those already processed is made more efficient by exploiting sim-ple semantic properties of the updates.