The Bw-Tree: A B-tree for new hardware platforms

By Justin J. Levandoski, David B. Lomet, Sudipta Sengupta. IEEE International Conference on Data Engineering, 2013

371 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory (2016, background): “The rise of ﬂash memory lead to the emergence of new optimized data structures such as the Bw-Tree [19].”
Speedy transactions in multicore in-memory databases (2013, background): “These can be broadly classiﬁed according to whether or not they provide transactional support.”
Hekaton: SQL server's memory-optimized OLTP engine (2013, neutral): “Hekaton supports two types of indexes: hash indexes which are implemented using lock-free hash tables [13] and range indexes which are implemented using Bw-trees, a novel lock-free version of B-trees [10].”
Amazon Aurora: Design Considerations for High Throughput Cloud-Native Relational Databases (2017, background): “More recently Deuteronomy and the associated work in LLAMA [34] and Bw-Tree [35] use log-structured techniques in multiple ways across the storage engine stack and, like Aurora, reduce write amplification by writing deltas instead of whole pages.”
In-Memory Big Data Management and Processing: A Survey (2015, methodology): “2 Latch-free Bw-Tree: Hekaton proposes a latchfree B-tree index, called Bw-tree [86], [228], which uses delta updates to make state changes, based on atomic compare-andswap (CAS) instructions and an elastic virtual page management subsystem – LLAMA [229].”