Partial replication in the Database State Machine

Sousa, António; Pedone, Fernando; Oliveira, Rui; Moura, Francisco

doi:10.1109/nca.2001.962546

Cited by 40 publications

(56 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While most of these systems use full replication [22], [23], our focus is on those supporting partial replication [1], [24], [25]. P-Store, [5] is probably the solution that is closer in spirit to the approaches proposed in this paper.…”

Section: Related Workmentioning

confidence: 99%

“…This paper studies the use of partial replication techniques in the context of in-memory caches. Even though partial replication has already been applied to distributed databases [1], there are significant differences in the workloads imposed to both systems and on the kind of processing related to the execution of transactions in both scenarios. More specifically, database management systems have the additional overheads of SQL parsing, synchronous storage, etc., that are absent in distributed in-memory cache systems [2].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Exploiting Total Order Multicast in Weakly Consistent Transactional Caches

Ruivo

Couceiro

Romano

et al. 2011

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing

View full text Add to dashboard Cite

Abstract-Nowadays, distributed in-memory caches are increasingly used as a way to improve the performance of applications that require frequent access to large amounts of data. In order to maximize performance and scalability, these platforms typically rely on weakly consistent partial replication mechanisms. These schemes partition the data across the nodes and ensure a predefined (and typically very small) replication degree, thus maximizing the global memory capacity of the platform and ensuring that the cost to ensure replica consistency remains constant as the scale of the platform grows. Moreover, even though several of these platforms provide transactional support, they typically sacrifice consistency, ensuring guarantees that are weaker than classic 1-copy serializability, but that allow for more efficient implementations.This paper proposes and evaluates two partial replication techniques, providing different (weak) consistency guarantees, but having in common the reliance on total order multicast primitives to serialize transactions without incurring in distributed deadlocks, a main source of inefficiency of classical two-phase commit (2PC) based replication mechanisms.We integrate the proposed replication schemes into Infinispan, a prominent open-source distributed in-memory cache, which represents the reference clustering solution for the well-known JBoss AS platform. Our performance evaluation highlights speed-ups of up to 40x when using the proposed algorithms with respect to the native Infinispan replication mechanism, which relies on classic 2PC-based replication.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Exploiting Total Order Multicast in Weakly Consistent Transactional Caches

Ruivo

Couceiro

Romano

et al. 2011

2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing

View full text Add to dashboard Cite

show abstract

“…Some of the proposed algorithms [16,14,15,20] have been presented using total order primitives with optimistic delivery. The goal is to compensate the inherent ordering latency by allowing tentative processing in parallel with the ordering protocol.…”

Section: Replication Protocolsmentioning

confidence: 99%

“…By keeping data strictly up-to-date in all replicas, application programmers do not have to manage complex reconciliation procedures and fail-over can happen without causing any committed updates to be lost. Recently, replication techniques based on group communication have been proposed as a means to overcome performance bottlenecks and make synchronous replication cost-effective [1,12,11,17,15,20].…”

Section: Introductionmentioning

confidence: 99%

Group-Based Replication of On-Line Transaction Processing Servers

Correia

Sousa

Soares

et al. 2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Several techniques for database replication using group communication have recently been proposed, namely, the Database State Machine, Postgres-R, and the NODO protocol. Although all rely on a totally ordered multicast for consistency, they differ substantially on how multicast is used. This results in different performance trade-offs which are hard to compare as each protocol is presented using a different load scenario and evaluation method.In this paper we evaluate the suitability of such protocols for replication of On-Line Transaction Processing (OLTP) applications in clusters of servers and over wide area networks. This is achieved by implementing them using a common infra-structure and by using a standard workload. The results allows us to select the best protocol regarding performance and scalability in a demanding but realistic usage scenario.

show abstract

“…Atomic Broadcast, was proposed by Sousa et al [121] as an adaptation of DBSM for partial replication. In partial replication, nodes maintain only the transaction information that refers to data items replicated in that node.…”

Section: Dbsm-rac Database State Machine With Resilient Atomic Commimentioning

confidence: 99%

On the Consistency, Characterization, Adaptability and Integrity of Database Replication Systems

Fuertes¹,

Idoia²

View full text Add to dashboard Cite

Since the appearance of the first distributed databases until the current modern replication systems, the research community has proposed multiple protocols to manage data distribution and replication, along with concurrency control algorithms to handle transactions running at every system node. Many protocols are thus available, each one with different features and performance, and guaranteeing different consistency levels. To know which replication protocol is the most appropriate, two aspects must be considered: the required level of consistency and isolation (i.e., the correctness criterion), and the properties of the system (i.e., the scenario), which will determine the achievable performance.Regarding correctness criteria, one-copy serializability is broadly accepted as the highest level of correctness. However, its definition allows different interpretations regarding replica consistency. In this thesis, we establish a correspondence between memory consistency models, as defined in the scope of distributed shared memory, and possible levels of replica consistency, thus defining new correctness criteria that correspond to the identified interpretations of one-copy serializability.Once selected the correctness criterion, the achievable performance of a system heavily depends on the scenario, i.e., the sum of both the system environment and the applications running on it. In order for the administrator to select a proper replication protocol, the available protocols must be fully and deeply known. A good description of each candidate is fundamental, but a common ground is mandatory to compare the different options and to estimate their performance in the given scenario. This thesis proposes a precise characterization model that allows us to decompose algorithms into individual interactions between significant system elements, as well as to define some underlying properties, and to associate v each interaction with a specific policy that governs it. We later use this model as basis for a historical study of the evolution of database replication techniques, thus providing an exhaustive survey of the principal existing systems.Although a specific replication protocol may be the best option for certain scenario, as systems are dynamic and heterogeneous, it is difficult for a single protocol to continuously be the proper choice, as it may degrade or be unable to meet all requirements. In this thesis we propose a metaprotocol that supports several replication protocols which follow different replication techniques and may provide different isolation levels. With this metaprotocol, replication protocols can either work concurrently with the same data or be sequenced for adapting to dynamic environments.Finally we consider integrity constraints, which are extensively used in databases to define semantic properties of data but are often forgotten in replicated databases. We analyze the potential problems this may involve and provide simple guidelines to extend a protocol so that it notices and properly manage...

show abstract

Partial replication in the Database State Machine

Cited by 40 publications

References 52 publications

Exploiting Total Order Multicast in Weakly Consistent Transactional Caches

Exploiting Total Order Multicast in Weakly Consistent Transactional Caches

Group-Based Replication of On-Line Transaction Processing Servers

On the Consistency, Characterization, Adaptability and Integrity of Database Replication Systems

Contact Info

Product

Resources

About