Update propagation protocols for replicated databates

  • Authors:

  • Yuri Breitbart;Raghavan Komondoor;Rajeev Rastogi;S. Seshadri;Avi Silberschatz

  • Affiliations:

  • Bell Laboratories, Murray Hill, NJ;University Of Wisconsin, Madison, WI;Bell Laboratories, Murray Hill, NJ;Bell Laboratories, Murray Hill, NJ;Bell Laboratories, Murray Hill, NJ

  • Venue:
  • SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

Replication is often used in many distributed systems to provide a higher level of performance, reliability and availability. Lazy replica update protocols, which propagate updates to replicas through independent transactions after the original transaction commits, have become popular with database vendors due to their superior performance characteristics. However, if lazy protocols are used indiscriminately, they can result in non-serializable executions. In this paper, we propose two new lazy update protocols that guarantee serializability but impose a much weaker requirement on data placement than earlier protocols. Further, many naturally occurring distributed systems, like distributed data warehouses, satisfy this requirement. We also extend our lazy update protocols to eliminate all requirements on data placement. The extension is a hybrid protocol that propagates as many updates as possible in a lazy fashion. We implemented our protocols on the Datablitz database system product developed at Bell Labs. We also conducted an extensive performance study which shows that our protocols outperform existing protocols over a wide range of workloads.