Serializable HTAP with Abort-/Wait-free Snapshot Read

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shioi, Takamitsu, Kambayashi, Takashi, Arakawa, Suguru, Kurosawa, Ryoji, Hikida, Satoshi, Yokota, Haruo
Format: Preprint
Veröffentlicht: 2022
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909949680943104
author Shioi, Takamitsu
Kambayashi, Takashi
Arakawa, Suguru
Kurosawa, Ryoji
Hikida, Satoshi
Yokota, Haruo
author_facet Shioi, Takamitsu
Kambayashi, Takashi
Arakawa, Suguru
Kurosawa, Ryoji
Hikida, Satoshi
Yokota, Haruo
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2201_07993
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Serializable HTAP with Abort-/Wait-free Snapshot Read
Shioi, Takamitsu
Kambayashi, Takashi
Arakawa, Suguru
Kurosawa, Ryoji
Hikida, Satoshi
Yokota, Haruo
Databases
H.2.4
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.
title Serializable HTAP with Abort-/Wait-free Snapshot Read
topic Databases
H.2.4
url https://arxiv.org/abs/2201.07993