Relaxed-currency serializability for middle-tier caching and replication

  • Authors:
  • Philip A. Bernstein;Alan Fekete;Hongfei Guo;Raghu Ramakrishnan;Pradeep Tamma

  • Affiliations:
  • Microsoft Corporation;University of Sydney;Microsoft Corporation;University of Wisconsin-Madison;University of Wisconsin-Madison

  • Venue:
  • Proceedings of the 2006 ACM SIGMOD international conference on Management of data
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many applications, such as e-commerce, routinely use copies of data that are not in sync with the database due to heuristic caching strategies used to enhance performance. We study concurrency control for a transactional model that allows update transactions to read out-of-date copies. Each read operation carries a "freshness constraint" that specifies how fresh a copy must be in order to be read. We offer a definition of correctness for this model and present algorithms to ensure several of the most interesting freshness constraints. We outline a serializability-theoretic correctness proof and present the results of a detailed performance study.