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 mono-master 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.
This work was partially financed by the French ANR-ARA Respire project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alonso, R., Barbará, D., Garcia-Molina, H.: Data caching issues in an information retrieval system. ACM Trans. on Database Systems 15(3), 359–384 (1990)
Barbará, D., Garcia-Molina, H.: The demarcation protocol: A technique for maintaining constraints in distributed database systems. VLDB Journal 3(3), 325–353 (1994)
Berenson, H., et al.: A critique of ansi isolation levels. In: ACM SIGMOD Int. Conf, ACM Press, New York (1995)
Breitbart, Y., et al.: Update propagation protocols for replicated databates. In: ACM SIGMOD Int. Conf, pp. 97–108. ACM Press, New York (1999)
Carney, D., Lee, S., Zdonik, S.: Scalable application aware data freshening. In: IEEE Int. Conf. on Data Engineering, IEEE Computer Society Press, Los Alamitos (2002)
Chundi, P., Rosenkrantz, D.J., Ravi, S.S.: Deferred updates and data placement in distributed databases. In: IEEE Int. Conf. on Data Engineering, pp. 469–476. IEEE Computer Society Press, Los Alamitos (1996)
Colby, L.S., et al.: Algorithms for deferred view maintenance. In: ACM SIGMOD Int. Conf., Montreal, Quebec, Canada, pp. 469–480. ACM, New York (1996)
Gançarski, S., Le Pape, C., Naacke, H.: Fine-grained refresh strategies for managing replication in database clusters. In: VLDB Wshp. on Design, Implementation and Deployment of Database Replication, pp. 47–54 (2005)
Gançarski, S., et al.: The leganet system: Freshness-aware transaction routing in a database cluster. Information Systems. To appear
Gançarski, S., et al.: Parallel processing with autonomous databases in a cluster system. In: Int. Conf. On Cooperative Information Systems (CoopIS) (2002)
Guo, H., et al.: Relaxed currency and consistency: How to say ”good enough” in sql. In: ACM SIGMOD Int. Conf, ACM Press, New York (2004)
Kemme, B., Alonso, G.: A new approach to developing and implementing eager database replication protocols. ACM Trans. on Database Systems 25(3), 333–379 (2000)
Krishnamurthy, S., Sanders, W.H., Cukier, M.: An adaptive framework for tunable consistency and timeliness using replication. In: Int. Conf. on Dependable Systems and Networks, pp. 17–26 (2002)
Labrinidis, A., Roussopoulos, N.: Balancing performance and data freshness in web database servers. In: Int. Conf. on VLDB, pp. 393–404 (2003)
Le Pape, C., Gançarski, S., Valduriez, P.: Refresco: Improving query performance through freshness control in a database cluster. In: Int. Conf. On Cooperative Information Systems (CoopIS), pp. 174–193 (2004)
Liu, H., Ng, W.-K., Lim, E.-P.: Scheduling queries to improve the freshness of a website. World Wide Web 8(1), 61–90 (2005)
Malaika, S., Eisenberg, A., Melton, J.: Standards for databases on the grid. SIGMOD Rec. 32(3), 92–100 (2003), doi:10.1145/945721.945739
Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: Int. Conf. on VLDB (2000)
Pacitti, E., Minet, P., Simon, E.: Fast algorithms for maintaining replica consistency in lazy master replicated databases. In: Int. Conf. on VLDB (1999)
Pacitti, E., Simon, E.: Update propagation strategies to improve freshness in lazy master replicated databases. VLDB Journal 8(3–4), 305–318 (2000)
Röhm, U., Böhm, K., Schek, H.-J.: Cache-aware query routing in a cluster of databases. In: IEEE Int. Conf. on Data Engineering, IEEE Computer Society Press, Los Alamitos (2001)
Röhm, U., et al.: Fas - a freshness-sensitive coordination middleware for a cluster of olap components. In: Int. Conf. on VLDB (2002)
Saito, Y., Levy, H.M.: Optimistic replication for internet data services. In: Int. Symp. on Distributed Computing, pp. 297–314 (2000), citeseer.ist.psu.edu/saito00optimistic.html
Shah, S., Ramamritham, K., Shenoy, P.: Maintaining coherency of dynamic data in cooperative repositories. In: Int. Conf. on VLDB (1995)
Yu, H., Vahdat, A.: Efficient numerical error bounding for replicated network services. In: Int. Conf. on VLDB (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Le Pape, C., Gançarski, S. (2007). Replica Refresh Strategies in a Database Cluster. In: Daydé, M., Palma, J.M.L.M., Coutinho, Á.L.G.A., Pacitti, E., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2006. VECPAR 2006. Lecture Notes in Computer Science, vol 4395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71351-7_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-71351-7_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71350-0
Online ISBN: 978-3-540-71351-7
eBook Packages: Computer ScienceComputer Science (R0)