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

分层B树和版本字典

Stratified B-trees and versioning dictionaries

Andy Twigg, Andrew Byde, Grzegorz Milos, Tim Moreton, John Wilkes, Tom Wilkie

摘要:

在存储和计算机科学中,一个经典的版本化数据结构是写时复制(CoW)B树--它是当今许多文件系统和数据库的基础,包括WAFL、NTFS、Btrfs等。不幸的是,它没有继承B树的最优属性;它的空间利用率很低,不能提供快速更新,并且依赖于随机IO来扩展。然而,从那以后就没有更好的了。我们描述了“分层B树”,它击败了所有已知的半外部内存版本的B树,包括牛B树。特别是,它是第一个在空间,查询和更新性能之间实现最佳权衡的版本化字典。

英文摘要:

A classic versioned data structure in storage and computer science is the copy-on-write (CoW) B-tree -- it underlies many of today's file systems and databases, including WAFL, ZFS, Btrfs and more. Unfortunately, it doesn't inherit the B-tree's optimality properties; it has poor space utilization, cannot offer fast updates, and relies on random IO to scale. Yet, nothing better has been developed since. We describe the `stratified B-tree', which beats all known semi-external memory versioned B-trees, including the CoW B-tree. In particular, it is the first versioned dictionary to achieve optimal tradeoffs between space, query and update performance.

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

↑