Transaction Routing with Freshness Control in a Cluster of Replicated Databases

Hubert Naacke 1 François Dang Ngoc 2 Patrick Valduriez 3
1 OASIS - Objets et Agents pour Systèmes d'Information et Simulation
LIP6 - Laboratoire d'Informatique de Paris 6
2 SMIS - Secured and Mobile Information Systems
PRISM - Parallélisme, Réseaux, Systèmes, Modélisation, UVSQ - Université de Versailles Saint-Quentin-en-Yvelines, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8144
3 ATLAS - Complex data management in distributed systems
UN - Université de Nantes, Inria Rennes – Bretagne Atlantique
Abstract : We consider the use of a cluster system with a shared nothing architecture for update-intensive autonomous databases. To optimize load balancing, we use optimistic database replication with freshness control. We propose a solution to transaction routing that preserves database and application autonomy and a cost model to estimate replica freshness. Then we propose an algorithm for transaction routing that takes into account freshness requirements of transactions and replica freshness. We implemented our solution on a Linux cluster running Oracle 8i and performed extensive performance experiments using the TPC-C OLTP benchmark. Our results show that our solution outperforms existing solutions for typical transaction workloads.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-02019887
Contributor : Hubert Naacke <>
Submitted on : Thursday, February 14, 2019 - 6:30:39 PM
Last modification on : Thursday, March 21, 2019 - 2:17:27 PM

Identifiers

  • HAL Id : hal-02019887, version 1

Citation

Hubert Naacke, François Dang Ngoc, Patrick Valduriez. Transaction Routing with Freshness Control in a Cluster of Replicated Databases. BDA 2003 - 19èmes Journées Bases de Données Avancées, Oct 2003, Lyon, France. ⟨hal-02019887⟩

Share

Metrics

Record views

71