arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.13294cs.DB
收藏

Griffin:结合哈希与B+-树的快速事务型数据库索引

Griffin: Fast Transactional Database Index with Hash and B+-Tree

Sho Nakazono, Yutaro Bessho, Hideyuki Kawashima, Tatsuhiro Nakamori

AI总结:

Griffin提出哈希表与B+-树结合的混合索引架构,通过O(1)点操作访问和无需额外遍历的精确锁定幻象避免方法,在点操作和范围操作主导负载下分别实现最高3.1倍和5.4倍的吞吐量提升。

摘要:

索引访问是事务型数据库系统中占主导地位的性能因素之一。许多系统使用B+-树或其变体来处理点操作和范围操作。这种访问模式仍有性能改进空间。首先,点操作理论上可以借助哈希表在$O(1)$时间内完成。其次,为了保证事务的可串行化,范围操作会因幻象避免技术而产生额外开销,这些技术涉及额外的处理或同步,例如对B+-树的额外遍历。为解决这些问题,我们提出了一种混合索引架构Griffin。对于点操作,Griffin具有一个可在$O(1)$时间内提供访问路径的哈希表,同时保留B+-树。对于幻象避免,Griffin采用一种精确锁定方法,不需要对B+-树进行额外遍历。尽管采用混合架构,Griffin仍透明地提供可线性化的操作和单一数据库索引接口。我们构建了一个结合哈希表与BwTree的Griffin索引。与仅由BwTree组成的基线索引相比,在点操作占主导的工作负载中,其吞吐量最高提升3.1倍;在范围操作占主导的工作负载中,吞吐量最高提升5.4倍。

英文摘要:

Index access is one of the dominant performance factors in transactional database systems. Many systems use a B+-tree or one of its variants to handle point and range operations. This access pattern has room for performance improvement. Firstly, point operations can potentially be processed in $O(1)$ with a hash table. Secondly, to ensure serializability of transactions, range operations incur overhead from phantom avoidance techniques that involve additional processing or synchronization, such as an extra traversal of the B+-tree. To address these issues, we propose a hybrid index architecture, Griffin. For point operations, Griffin has a hash table that provides access paths in $O(1)$ time, along with a B+-tree. For phantom avoidance, Griffin employs a precision locking method, which does not involve additional traversal of the B+-tree. Despite its hybrid architecture, Griffin transparently provides linearizable operations and an interface of a single database index. We built a Griffin index combining a hash table and BwTree. Compared to a baseline index that is composed of a BwTree only, it achieves up to 3.1x higher throughput in a point operation dominant workload, and up to 5.4x higher throughput in a range operation dominant workload.

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

↑