Lazy Database Replication with Ordering Guarantees

  • Authors:
  • Khuzaima Daudjee;Kenneth Salem

  • Affiliations:
  • -;-

  • Venue:
  • ICDE '04 Proceedings of the 20th International Conference on Data Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lazy replication is a popular technique for improvingthe performance and availability of database systems. Althoughthere are concurrency control techniques whichguarantee serializability in lazy replication systems, thesetechniques may result in undesirable transaction orderings.Since transactions may see stale data, they may be serializedin an order different from the one in which they weresubmitted. Strong serializability avoids such problems, butit is very costly to implement. In this paper, we propose ageneralized form of strong serializability that is suitable foruse with lazy replication. In addition to having many of theadvantages of strong serializability, it can be implementedmore efficiently. We show how generalized strong serializabilitycan be implemented in a lazy replication system, andwe present the results of a simulation study that quantifiesthe strengths and limitations of the approach.