TY - GEN
T1 - PEEP
T2 - 26th International Conference on Database Systems for Advanced Applications, DASFAA 2021
AU - Chen, Zhihao
AU - Qi, Xiaodong
AU - Du, Xiaofan
AU - Zhang, Zhao
AU - Jin, Cheqing
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Unlike blockchain systems in public settings, the stricter trust model in permissioned blockchain opens an opportunity for pursuing higher throughput. Recently, as the consensus protocols are developed significantly, the existing serial execution manner of transactions becomes a key factor in limiting overall performance. However, it is not easy to extend the concurrency control protocols, widely used in database systems, to blockchain systems. In particular, there are two challenges to achieve parallel execution of transactions in blockchain as follows: (i) the final results of different replicas may diverge since most protocols just promise the effect of transactions equivalent to some serial order but this order may vary for every concurrent execution; and (ii) almost all state trees that are used to manage states of blockchain do not support fast concurrent updates. In the view of above challenges, we propose a parallel execution engine called PEEP, towards permissioned blockchain systems. Specifically, PEEP employs a deterministic concurrency mechanism to obtain a predetermined serial order for parallel execution, and offers parallel update operations on state tree, which can be implemented on any radix tree with Merkle property. Finally, the extensive experiments show that PEEP outperforms existing serial execution greatly.
AB - Unlike blockchain systems in public settings, the stricter trust model in permissioned blockchain opens an opportunity for pursuing higher throughput. Recently, as the consensus protocols are developed significantly, the existing serial execution manner of transactions becomes a key factor in limiting overall performance. However, it is not easy to extend the concurrency control protocols, widely used in database systems, to blockchain systems. In particular, there are two challenges to achieve parallel execution of transactions in blockchain as follows: (i) the final results of different replicas may diverge since most protocols just promise the effect of transactions equivalent to some serial order but this order may vary for every concurrent execution; and (ii) almost all state trees that are used to manage states of blockchain do not support fast concurrent updates. In the view of above challenges, we propose a parallel execution engine called PEEP, towards permissioned blockchain systems. Specifically, PEEP employs a deterministic concurrency mechanism to obtain a predetermined serial order for parallel execution, and offers parallel update operations on state tree, which can be implemented on any radix tree with Merkle property. Finally, the extensive experiments show that PEEP outperforms existing serial execution greatly.
KW - Blockchain
KW - Execution optimization
KW - Permissioned
UR - https://www.scopus.com/pages/publications/85104729721
U2 - 10.1007/978-3-030-73200-4_24
DO - 10.1007/978-3-030-73200-4_24
M3 - 会议稿件
AN - SCOPUS:85104729721
SN - 9783030731991
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 341
EP - 357
BT - Database Systems for Advanced Applications - 26th International Conference, DASFAA 2021, Proceedings
A2 - Jensen, Christian S.
A2 - Lim, Ee-Peng
A2 - Yang, De-Nian
A2 - Lee, Wang-Chien
A2 - Tseng, Vincent S.
A2 - Kalogeraki, Vana
A2 - Huang, Jen-Wei
A2 - Shen, Chih-Ya
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 11 April 2021 through 14 April 2021
ER -