Skip to search formSkip to main contentSkip to account menu

Optimistic replication

Known as: Lazy replication 
Optimistic replication (also known as lazy replication) is a strategy for replication in which replicas are allowed to diverge. Traditional… 
Wikipedia

Related topics

Related topics

18 relations
Coda (file system)Concurrency (computer science)Concurrent Versions SystemConflict-free replicated data type

Broader (1)

Data synchronization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Verifying eventual consistency of optimistic replication systems
We address the verification problem of eventual consistency of optimistic replication systems. Such systems are typically used to… 
Highly Cited
2013
Highly Cited
2013
Highly Available Transactions: Virtues and Limitations
To minimize network latency and remain online during server failures and network partitions, many modern distributed data storage… 
Highly Cited
2009
Highly Cited
2009
Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks
Massive collaborative editing becomes a reality through leading projects such as Wikipedia. This massive collaboration is… 
Review
2005
Review
2005
Optimistic replication
Data replication is a key technology in distributed systems that enables higher availability and performance. This article… 
Review
2003
Review
2003
The evolution of, and revolution in, land surface schemes designed for climate models
The land surface is a key component of climate models. It controls the partitioning of available energy at the surface between… 
Highly Cited
2000
Highly Cited
2000
Database replication techniques: a three parameter classification
Data replication is an increasingly important topic as databases are more and more deployed over clusters of workstations. One of… 
Highly Cited
1998
Highly Cited
1998
Rumor: Mobile Data Access Through Optimistic Peer-to-Peer Replication
Rumor is an optimistically replicated file system designed for use in mobile computers. Rumor uses a peer model that allows… 
Highly Cited
1996
Highly Cited
1996
The dangers of replication and a solution
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up: a ten-fold increase in… 
Highly Cited
1993
Highly Cited
1993
Consistency algorithms for optimistic replication
This paper presents a practical set of algorithms for maintaining the consistency of a replicated file system with an optimistic… 
Highly Cited
1992
Highly Cited
1992
Providing high availability using lazy replication
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License