Discarding Obsolete Information in a Replicated Database System
IEEE Transactions on Software Engineering - Special issue on distributed systems
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Independent updates and incremental agreement in replicated databases
Distributed and Parallel Databases
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
The Bengal Database Replication System
Distributed and Parallel Databases
The IceCube approach to the reconciliation of divergent replicas
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Panasync: dependency tracking among file copies
EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
Clique: A Transparent, Peer-to-Peer Replicated File System
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Rumor: Mobile Data Access Through Optimistic Peer-to-Peer Replication
ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
Efficient solutions to the replicated log and dictionary problems
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
The Hash History Approach for Reconciling Mutual Inconsistency
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Exploiting schemas in data synchronization
Journal of Computer and System Sciences
Flexible and safe resolution of file conflicts
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Detection of Mutual Inconsistency in Distributed Systems
IEEE Transactions on Software Engineering
Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems
IEEE Distributed Systems Online
Concise version vectors in WinFS
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Exploiting schemas in data synchronization
Journal of Computer and System Sciences
TierStore: a distributed filesystem for challenged networks in developing regions
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Hi-index | 0.00 |
Current techniques for reconciling disconnected changes to optimistically replicated data often use version vectors or related mechanisms to track causal histories. This allows the system to tell whether the value at one replica dominates another or whether the two replicas are in conflict. However, current algorithms do not provide entirely satisfactory ways of repairing conflicts. The usual approach is to introduce fresh events into the causal history, even in situations where the causally independent values at the two replicas are actually equal. In some scenarios these events may later conflict with each other or with further updates, slowing or even preventing convergence of the whole system. To address this issue, we enrich the set of possible actions at a replica to include a notion of explicit conflict resolution between existing events, where the user at a replica declares that one set of events dominates another, or that a set of events are equivalent. We precisely specify the behavior of this refined replication framework from a user's point of view and show that, if communication is assumed to be “reciprocal” (with pairs of replicas exchanging information about their current states), then this specification can be implemented by an algorithm with the property that the information stored at any replica and the sizes of the messages sent between replicas are bounded by a polynomial function of the number of replicas in the system.