bLSM: a general purpose log structured merge tree
By Russell Sears, Raghu Ramakrishnan. SIGMOD Conference, 2012
351 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Hardware and Architecture, Information Systems
View Paper: https://www.semanticscholar.org/paper/f4147b82166813bbe5dc01e9486664c273d1556c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Josef Bacik
- Andrea C. Arpaci-Dusseau
- Remzi H. Arpaci-Dusseau
- Ittai Abraham
- Chris Mason
- Lanyue Lu
- Ohad Rodeh
- Thanumalayan Sankaranarayana Pillai
In Hardware and Architecture
- Josef Bacik
- Andrea C. Arpaci-Dusseau
- Remzi H. Arpaci-Dusseau
- Ittai Abraham
- Chris Mason
- Lanyue Lu
- Ohad Rodeh
- Thanumalayan Sankaranarayana Pillai
In Information Systems
- Josef Bacik
- Andrea C. Arpaci-Dusseau
- Remzi H. Arpaci-Dusseau
- Pandian Raju
- Ittai Abraham
- Vijay Chidambaram
- Chris Mason
- Lanyue Lu
Citations in the corpus
- BTRFS: The Linux B-Tree Filesystem (2013, methodology): “2006; Dean and Ghemawat], YahooTM [Sears and Ramakrishnan 2012] in its PNUTS platform, and others.”
- PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees (2017, background): “bLSM [51] introduces a new merge scheduler to minimize write latency and maintain write throughput, and uses bloom filters to improve performance.”
- WiscKey (2016, methodology): “bLSM [49] presents a new merge scheduler to bound write latency, thus maintaining a steady write throughput, and also uses bloom filters to improve performance.”