Discarding Obsolete Information in a Replicated Database System
IEEE Transactions on Software Engineering - Special issue on distributed systems
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Weak-consistency group communication and membership
Weak-consistency group communication and membership
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
The Bengal Database Replication System
Distributed and Parallel Databases
Scalable Update Propagation in Epidemic Replicated Databases
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Version Stamps " Decentralized Version Vectors
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The Hash History Approach for Reconciling Mutual Inconsistency
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Lightweight Version Vectors for Pervasive Computing Devices
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Resolving file conflicts in the Ficus file system
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
Detection of Mutual Inconsistency in Distributed Systems
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Optimistic replication accepts changes to replicateddata sets without immediate coordination, with theassumption that conflicts can later be resolved by aseparate protocol. This protocol will subsequentlyreconcile changes between replicas, and detect andresolve any conflicts. In this paper we present a log-basedreconciliation architecture that is designed torecord and reconcile changes to data efficiently interms of communication and storage overhead.Redundancy is eliminated through the use of a log-basedstorage mechanism. A general data modelaccommodates a large variety of data types. Becauseof its storage efficiency, the architecture is especiallysuited to small data such as database records.