Replication and consistency: being lazy helps sometimes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Replication, consistency, and practicality: are these mutually exclusive?
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Update propagation protocols for replicated databates
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Multi-site distributed database transactions utilizing deferred update
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
A new approach to developing and implementing eager database replication protocols
ACM Transactions on Database Systems (TODS)
Replica Consistency in Lazy Master Replicated Databases
Distributed and Parallel Databases
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Don't Be Lazy, Be Consistent: Postgres-R, A New Way to Implement Database Replication
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Delay Optimizations in Quorum Consensus
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Update Propagation of Replicated Data in Distributed Spatial Databases
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Update propagation strategies to improve freshness in lazy master replicated databases
The VLDB Journal — The International Journal on Very Large Data Bases
Middleware based data replication providing snapshot isolation
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Fine-grained replication and scheduling with freshness and correctness guarantees
VLDB '05 Proceedings of the 31st international conference on Very large data bases
MIDDLE-R: Consistent database replication at the middleware level
ACM Transactions on Computer Systems (TOCS)
Neptune: scalable replication management and programming support for cluster-based network services
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Pronto: High availability for standard off-the-shelf databases
Journal of Parallel and Distributed Computing
Snapshot isolation and integrity constraints in replicated databases
ACM Transactions on Database Systems (TODS)
Load-Aware Dynamic Replication Management in a Data Grid
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Replica refresh strategies in a database cluster
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Weak consistency in hybrid group update for replication
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Database replication based on group communication: implementation issues
Future directions in distributed computing
Transactional storage for geo-replicated systems
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Analysis of the abortion rate on lazy replication protocols
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
Database replication: a tutorial
Replication
Dynamic primary copy with piggy-backing mechanism for replicated UDDI registry
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
Commercial distributed database systems generally support an optional protocol that provides loose consistency of replicas, allowing replicas to be inconsistent for some time. In such a protocol, each replicated data item is assigned a primary copy site. Typically, a transaction updates only the primary copies of data items, with updates to other copies deferred until after the transaction commits. After a transaction commits, its updates to primary copies are sent transactionally to the other sites containing secondary copies. We investigate the transaction model underlying the above protocol. We show that global serializability in such a system is a property of the placement of primary and secondary copies of replicated data items. We present a polynomial time algorithm to assign primary sites to data items so that the resulting topology ensures serializability.