<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alfrânio Correia</style></author><author><style face="normal" font="default" size="100%">José Orlando Pereira</style></author><author><style face="normal" font="default" size="100%">Rui Oliveira</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Robert Meersman</style></author><author><style face="normal" font="default" size="100%">Z. Tari</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">AKARA: A Flexible Clustering Protocol for Demanding Transactional Workloads</style></title><secondary-title><style face="normal" font="default" size="100%">OTM International Symposium on Distributed Objects, Middleware, and Applications - DOA</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">November </style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-540-88871-0_48</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jop/files/akara.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Monterrey, Mexico</style></pub-location><volume><style face="normal" font="default" size="100%">5331</style></volume><pages><style face="normal" font="default" size="100%">{691-708}</style></pages><isbn><style face="normal" font="default" size="100%">{978-3-540-88870-3}</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Shared-nothing clusters are a well known and cost-effective approach to database server scalability, in particular, with highly intensive read-only workloads typical of many 3-tier web-based applications. The common reliance on a centralized component and a simplistic propagation strategy employed by mainstream solutions however conduct to poor scalability with traditional on-line transaction processing (OLTP), where the update ratio is high. Such approaches also pose an additional obstacle to high availability while introducing a single point of failure.&lt;br /&gt;
More recently, database replication protocols based on group communication have been shown to overcome such limitations, expanding the applicability of shared-nothing clusters to more demanding transactional workloads. These take simultaneous advantage of total order multicast and transactional semantics to improve on mainstream solutions. However, none has already been widely deployed in a general purpose database management system.&lt;br /&gt;
In this paper, we argue that a major hurdle for their acceptance is that these proposals have disappointing performance with specific subsets of real-world workloads. Such limitations are deep-rooted and working around them requires in-depth understanding of protocols and changes to applications. We address this issue with a novel protocol that combines multiple transaction execution mechanisms and replication techniques and then show how it avoids the identified pitfalls. Experimental results are obtained with a workload based on the industry standard TPC-C benchmark.&lt;/p&gt;
</style></abstract><work-type><style face="normal" font="default" size="100%">{Proceedings Paper}</style></work-type></record></records></xml>