bLSM: A General Purpose Log Structured Merge Tree
Summary: Introduces bLSM, an LSM-tree blending log-structured and B-tree reads for near-optimal reads and high write performance. Spring-and-gear merge scheduler bounds latency with steady progress; Bloom filters curb lookups and reads stop after first version. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Russell Sears (Yahoo)
- 2. Raghu Ramakrishnan (Yahoo)
BibTeX Citation
@inproceedings{sears_sigmod12,
title = {{bLSM: A General Purpose Log Structured Merge Tree}},
author = {Sears, Russell and Ramakrishnan, Raghu},
series = {{SIGMOD} '12},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2213836.2213862},
url = {https://dl.acm.org/doi/10.1145/2213836.2213862},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 65 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 47 | PNUTS: Yahoo!'s Hosted Data Serving Platform | 2008 | VLDB | 0.00043937456 |
| 515 | Tree Indexing on Solid State Drives | 2010 | VLDB | 0.00016989841 |
| 791 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.00013927839 |
| 818 | Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method | 1998 | VLDB | 0.00013657405 |
| 1,077 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00012122621 |
| 1,308 | Apache Hadoop Goes Realtime at Facebook | 2011 | SIGMOD | 0.0001107127 |
| 2,905 | Rose: Compressed, log-structured replication | 2008 | VLDB | 7.871271e-05 |
| 5,325 | Segment-Based Recovery: Write-ahead logging revisited | 2009 | VLDB | 6.1643901e-05 |
| 5,784 | Walnut: A Unified Cloud Object Store | 2012 | SIGMOD | 5.9773452e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,429 | The Log-Structured Merge-Bush & the Wacky Continuum | 2019 | SIGMOD |
| 2 | 6,649 | LSM-Trees and B-Trees: The Best of Both Worlds | 2019 | SIGMOD |
| 3 | 6,500 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |
| 4 | 11,913 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD |
| 5 | 12,257 | Splaying Log-Structured Merge-Trees | 2018 | SIGMOD |
| 6 | 5,065 | Dissecting, Designing, and Optimizing LSM-based Data Stores | 2022 | SIGMOD |
| 7 | 4,141 | On Performance Stability in LSM-based Storage Systems | 2020 | VLDB |
| 8 | 6,954 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD |
| 9 | 7,609 | Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems | 2019 | VLDB |
| 10 | 8,666 | Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees | 2025 | SIGMOD |