Serializable HTAP with Abort-/Wait-free Snapshot Read

01/20/2022
by   Takamitsu Shioi, et al.
0

Concurrency Control (CC) ensuring consistency of updated data is an essential element of OLTP systems. Recently, hybrid transactional/analytical processing (HTAP) systems developed for executing OLTP and OLAP have attracted much attention. The OLAP side CC domain has been isolated from OLTP's CC and in many cases has been achieved by snapshot isolation (SI) to establish HTAP systems. Although higher isolation level is ideal, considering OLAP read-only transactions in the context of OLTP scheduling achieving serializability forces aborts/waits and would be a potential performance problem. Furthermore, executing OLAP without affecting OLTP as much as possible is needed for HTAP systems. The aim of this study was serializability without additional aborts/waits. We propose read safe snapshot (RSS) using multiversion CC (MVCC) theory and introduce the RSS construction algorithm utilizing serializable snapshot isolation (SSI). For serializability of HTAP systems, our model makes use of multiversion and allows more schedules with read operations whose corresponding write operations do not participate in the dependency cycles. Furthermore, we implemented the algorithm practically in an open-source database system that offers SSI. Our algorithm was integrated into two types of architecture as HTAP systems called as unified (single-node) or decoupled (multinode) storage architecture. We evaluate the performance and abort rate of the single-node architecture where SSI is applicable. The multi-node architecture was investigated for examining the performance overhead applying our algorithm.

READ FULL TEXT

page 11

page 12

research
10/27/2021

Systematic definition and classification of data anomalies in DBMS (English Version)

There is no unified definition of Data anomalies, which refers to the sp...
research
07/26/2021

Robustness against Read Committed for Transaction Templates

The isolation level Multiversion Read Committed (RC), offered by many da...
research
03/16/2018

Distributed Transactions: Dissecting the Nightmare

Many distributed storage systems are transactional and a lot of work has...
research
05/13/2016

Efficiently making (almost) any concurrency control mechanism serializable

Concurrency control (CC) algorithms must trade off strictness for perfor...
research
11/26/2019

Distributed graphs: in search of fast, low-latency, resource-efficient, semantics-rich Big-Data processing

Large graphs can be processed with single high-memory or distributed sys...
research
01/31/2019

A Platform Architecture for Multi-Tenant Blockchain-Based Systems

Blockchain has attracted a broad range of interests from start-ups, ente...
research
03/23/2018

Efficient Single Writer Concurrency

In this paper we consider single writer multiple reader concurrency - an...

Please sign up or login with your details

Forgot password? Click here to reset