![[논문 리뷰] When Private Blockchain Meets Deterministic Database](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbxSnJX%2FbtskQPdzlWp%2FAAAAAAAAAAAAAAAAAAAAAB4FktnkonK151Z5Cyv3IWc9DYmnM7C1G6tUEyDLAK8f%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DC%252FzrlUwo9yR803viXyWVIgXV%252B%252Fg%253D)
Authors:
Ziliang Lai, Chris Liu, Eric Lo
Journal/Conference:
ACM PODS ‘23
Source:
https://dl.acm.org/doi/10.1145/3588952
presentation materials:
Abstract
Private blockchain as a replicated transactional system shares many commonalities with distributed database. However, the intimacy between private blockchain and deterministic database has never been studied. In essence, private blockchain and deterministic database both ensure replica consistency by determinism. In this paper, we present a comprehensive analysis to uncover the connections between private blockchain and deterministic database. While private blockchains have started to pursue deterministic transaction executions recently, deterministic databases have already studied deterministic concurrency control protocols for almost a decade. This motivates us to propose Harmony, a novel deterministic concurrency control protocol designed for blockchain use. We use Harmony to build a new relational blockchain, namely HarmonyBC, which features low abort rates, hotspot resiliency, and inter-block parallelism, all of which are especially important to disk-oriented blockchain. Empirical results on Smallbank, YCSB, and TPC-C show that HarmonyBC offers 2.0x to 3.5x throughput better than the state-of-the-art private blockchains.
Introduction
Harmony DCC
Overview
(1) abort-minimizing validation
(2) update reordering
(3) inter-block parallelism
HarmonyBC
Discussion
- In the last experiment, the authors pose insightful question: "Harmony’s optimizations are still effective if all disk-related overheads in the database layer are gone?". The results showed that disk-oriented blockchains cannot exceed the throughput of memory-native blockchain.
- With this valueable insight, we can think of cost-effective performance (i.e., throughput per 1$ for memory/disk storage cost). For the enterpreneurs, they can design the blockchain system architecture in a the cost-effective way with this insight. (Which TPS they have to acheive?, How much money they have?, etc.)
- Meanwhile, there may be some possible attacks exploiting validation rules to make specific transactions to be aborted.