TY - GEN
T1 - An Optimized Solution for Highly Contended Transactional Workloads
AU - Zhang, Chunxi
AU - Zhang, Shuyan
AU - Chen, Ting
AU - Zhang, Rong
AU - Liu, Kai
N1 - Publisher Copyright:
© 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
PY - 2024
Y1 - 2024
N2 - High contention frequently explodes in E-commerce scenario when promotions are held. However, modern multi-core main-memory databases cannot achieve ideal performance under high contention. Transactions contending for the same resources must be executed serially in traditional architecture to guarantee correctness, which severely chokes database management systems. In this paper, we propose to optimize the transaction processing scheme for highly contended E-commerce workloads. First, we analyze the characteristics of these workloads in detail. Second, we design to filter ineffective operations at IO layer instead of sending them to executing layer, considering the limited number of items involved in the promotion. Third, we make out a homogeneous operation merging scheme to share database execution resources, e.g., locks, and improve parallelization. We implement a prototype, Filmer, to demonstrate our idea. Filmer launches filtering and merging for contended transactions to make full use of system resources and improve parallelization. Extensive experiments show that filtering and merging improve the throughput by up to 1.95 × and 2.55 × respectively.
AB - High contention frequently explodes in E-commerce scenario when promotions are held. However, modern multi-core main-memory databases cannot achieve ideal performance under high contention. Transactions contending for the same resources must be executed serially in traditional architecture to guarantee correctness, which severely chokes database management systems. In this paper, we propose to optimize the transaction processing scheme for highly contended E-commerce workloads. First, we analyze the characteristics of these workloads in detail. Second, we design to filter ineffective operations at IO layer instead of sending them to executing layer, considering the limited number of items involved in the promotion. Third, we make out a homogeneous operation merging scheme to share database execution resources, e.g., locks, and improve parallelization. We implement a prototype, Filmer, to demonstrate our idea. Filmer launches filtering and merging for contended transactions to make full use of system resources and improve parallelization. Extensive experiments show that filtering and merging improve the throughput by up to 1.95 × and 2.55 × respectively.
KW - concurrency control
KW - high contention
KW - transaction processing
UR - https://www.scopus.com/pages/publications/85180630579
U2 - 10.1007/978-981-99-8664-4_23
DO - 10.1007/978-981-99-8664-4_23
M3 - 会议稿件
AN - SCOPUS:85180630579
SN - 9789819986637
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 402
EP - 418
BT - Dependable Software Engineering. Theories, Tools, and Applications - 9th International Symposium, SETTA 2023, Proceedings
A2 - Hermanns, Holger
A2 - Sun, Jun
A2 - Bu, Lei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 9th International Symposium on Dependable Software Engineering: Theories, Tools and Applications, SETTA 2023
Y2 - 27 November 2023 through 29 November 2023
ER -