DMCA
Fine-Grained Lazy Replication with Strict Freshness and Correctness Guarantees (2004)
| Venue: | In Proc. International Conference on Very Large Data Bases (VLDB |
| Citations: | 2 - 1 self |
BibTeX
@TECHREPORT{Akal04fine-grainedlazy,
author = {Fuat Akal and Can Türker and Hans-jörg Schek and Yuri Breitbart and Fuat Akal and Can Türker and Hans-jörg Schek and Yuri Breitbart and Fuat Akal and Can Türker and Hans-jörg Schek},
title = {Fine-Grained Lazy Replication with Strict Freshness and Correctness Guarantees},
institution = {In Proc. International Conference on Very Large Data Bases (VLDB},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Eager replication management is known to generate unacceptable performance as soon as the update rate or the number of replicas increases. Lazy replication protocols tackle this problem by decoupling transaction execution from the propagation of new values to replica sites while guaranteeing a correct and more efficient transaction processing and replica maintenance. However, they impose several restrictions on transaction models that are often not valid in practical database settings, e.g., they require that each transaction executes at its initiation site and/or are restricted to full replication schemes. Also, the protocols cannot guarantee that the transactions will always see the freshest available replicas. This paper presents a new lazy replication protocol called PDBREP that is free
