Storage Engine

Diagram of an LSM-tree with bloom filters guarding each SSTable.

Implementing Bloom Filters in LSM-Trees: Reducing Read Amplification

A practical deep dive into how bloom filters are integrated into LSM-tree storage engines to slash read amplification, with concrete examples from RocksDB, Cassandra, and ScyllaDB.

Diagram of a log-structured merge tree with memtable, immutable memtables, and SSTable levels on disk.

Architecting Log-Structured Merge Trees for Write-Intensive Distributed Databases

How modern distributed databases turn the write-amplification problem into a throughput advantage, and what it costs you on the read path.

Diagram of an LSM‑tree with a Bloom filter overlay.

Optimizing Read Performance in LSM-Trees: Integrating Bloom Filters for Production-Grade Storage Engines

A deep dive into using Bloom filters to cut LSM‑tree read amplification, with real‑world architecture diagrams, Go implementation, and ops tips.

Diagram of a B-Tree with a node being split.

Why B-Tree Node Splitting Causes Unexpected Tail Latency

B‑Tree node splits can trigger rare but costly latency spikes; this post explains why they happen and how to mitigate tail latency in modern storage engines.

Diagram comparing LSM tree layers with B‑tree nodes.

Why Log-Structured Merge Trees Outperform B-Trees for Write Throughput

Explore how LSM trees boost write performance compared to B‑trees, the mechanics behind their design, and the trade‑offs involved.