Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Replica Freshness

  • Alan FeketeEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1367


Divergence control; Freshness control;Incoherency bounds


In a distributed system, information is often replicated with copies of the same data stored on several sites. Ideally, all copies would be kept identical, but doing this imposes a performance penalty. Many system designs allow replicas to lag behind the latest value. For some applications, it is acceptable to use out-of-date copies, provided they are not too far from the true, current value. Freshness refers to a measure of the difference between a replica and the current value.

Historical Background

The tradeoff between consistency and performance or availability is an old theme in distributed computing. In the database community, many researchers worked on ideas connected with explicitly allowing some discrepancy between replicas during the late 1980s and early 1990s. Early papers identified many of the diverse freshness measures discussed here, from groups at Princeton, Bellcore and Stanford [1, 10, 11]....

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Alonso R, Barbará D, Garcia-Molina H. Data caching issues in an information retrieval system. ACM Trans Database Syst. 1990;15(3):359–84.CrossRefGoogle Scholar
  2. 2.
    Bernstein PA, Fekete A, Guo H, Ramakrishnan R, Tamma P. Relaxed-currency serializability for middle-tier caching and replication. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2006. p. 599–610.Google Scholar
  3. 3.
    Guo H, Larson PÅ, Ramakrishnan R, Goldstein J. Relaxed currency and consistency: how to say “good enough” in SQL. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004. p. 815–26.Google Scholar
  4. 4.
    Olston C, Loo BT, Widom J. Adaptive precision setting for cached approximate values. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2001. p. 355–366.CrossRefGoogle Scholar
  5. 5.
    Pacitti E, Coulon C, Valduriez P, Özsu MT. Preventive replication in a database cluster. Distrib Parall Databases. 2005;18(3):223–51.CrossRefGoogle Scholar
  6. 6.
    Pu C and Leff A Replica control in distributed systems: as asynchronous approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1991. p. 377–86.CrossRefGoogle Scholar
  7. 7.
    Ramamritham K, Pu C. A formal characterization of epsilon serializability. IEEE Trans Knowl Data Eng. 1995;7(6):997–1007.CrossRefGoogle Scholar
  8. 8.
    Röhm U, Böhm K, Schek HJ, Schuldt H. FAS – a freshness-sensitive coordination middleware for a cluster of OLAP components. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 754–65.CrossRefGoogle Scholar
  9. 9.
    Shah S, Ramamritham K, Shenoy PJ. Resilient and coherence preserving dissemination of dynamic data using cooperating peers. IEEE Trans Knowl Data Eng. 2004;16(7):799–812.CrossRefGoogle Scholar
  10. 10.
    Sheth AP, Rusinkiewicz M. Management of interdependent data: specifying dependency and consistency requirements. In: Proceedings of the Workshop on the Management of Replicated Data; 1990. p. 133–6.Google Scholar
  11. 11.
    Wiederhold G, Qian X. Consistency control of replicated data in federated databases. In: Proceedings of the Workshop on the management of replicated data. Houston. 1990. p. 130–2.Google Scholar
  12. 12.
    Yu H, Vahdat A. Design and evaluation of a conit-based continuous consistency model for replicated services. ACM Trans Comput Syst. 2002;20(3):239–82.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.University of SydneySydneyAustralia

Section editors and affiliations

  • Bettina Kemme
    • 1
  1. 1.School of Computer ScienceMcGill Univ.MontrealCanada