Replica refresh strategies in a database cluster

  • Authors:
  • Cécile Le Pape;Stéphane Gançarski

  • Affiliations:
  • Laboratoire d’Informatique de Paris, Paris, France;Laboratoire d’Informatique de Paris, Paris, France

  • Venue:
  • VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

Relaxing replica freshness has been exploited in database clusters to optimize load balancing. However, in most approaches, refreshment is typically coupled with other functions such as routing or scheduling, which makes it hard to analyze the impact of the refresh strategy itself on performance. In this paper, we propose to support routing-independent refresh strategies in a database cluster with monomaster lazy replication. First, we propose a model for capturing existing refresh strategies. Second, we describe the support of this model in Refresco, a middleware prototype for freshness-aware routing in database clusters. Third, we describe an experimental validation to test some typical strategies against different workloads. The results show that the choice of the best strategy depends not only on the workload, but also on the conflict rate between transactions and queries and on the level of freshness required by queries. Although there is no strategy that is best in all cases, we found that one strategy is usually very good and could be used as default strategy.