arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.01675cs.DB
收藏

OLTP DBMS中基于冲突预测的智能事务调度

Intelligent Transaction Scheduling via Conflict Prediction in OLTP DBMS

Tieying Zhang, Anthony Tomasic, Andrew Pavlo

AI总结:

本文研究OLTP DBMS中基于冲突预测的智能事务调度,通过紧凑事务表示和历史信息最小化冲突,在20核机器上实现约40%的吞吐量提升。

摘要:

当前主内存在线事务处理(OLTP)数据库管理系统(DBMS)的架构通常使用随机调度将事务分配到线程。这种方法实现了线程间的均匀负载,但忽略了事务之间发生冲突的可能性。如果DBMS能够估计事务冲突的可能性,然后智能地调度事务以避免冲突,那么系统就可以提高性能。然而,这种对事务冲突的估计由于若干原因并非易事。首先,冲突发生在复杂条件下,这些条件在时间上与调度决策相距甚远。其次,事务必须以紧凑且高效的方式表示,以便实现快速的冲突检测。第三,在存在潜在冲突的某些证据时,DBMS必须以最小化这种冲突的方式调度事务。在本文中,我们系统地探索了解决这些问题的设计决策。然后,我们在标准OLTP基准上实证测量了不同表示方法对性能的影响。我们的结果表明,使用历史信息的智能调度在20核机器上将吞吐量提高了约40%。

英文摘要:

Current architectures for main-memory online transaction processing (OLTP) database management systems (DBMS) typically use random scheduling to assign transactions to threads. This approach achieves uniform load across threads but it ignores the likelihood of conflicts between transactions. If the DBMS could estimate the potential for transaction conflict and then intelligently schedule transactions to avoid conflicts, then the system could improve its performance. Such estimation of transaction conflict, however, is non-trivial for several reasons. First, conflicts occur under complex conditions that are far removed in time from the scheduling decision. Second, transactions must be represented in a compact and efficient manner to allow for fast conflict detection. Third, given some evidence of potential conflict, the DBMS must schedule transactions in such a way that minimizes this conflict. In this paper, we systematically explore the design decisions for solving these problems. We then empirically measure the performance impact of different representations on standard OLTP benchmarks. Our results show that intelligent scheduling using a history increases throughput by $\sim$40\% on 20-core machine.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑