Databases

Layered diagram of a copy-on-write B-tree showing page versions branching from a stable root.

Architecting Copy-on-Write B-Trees: High-Performance Snapshot Strategies for Production Databases

A practical deep dive into copy-on-write B-tree design: page versioning, root promotion, MVCC snapshots, and the GC strategies that keep production storage engines fast under write pressure.

Stylized illustration of a bloom filter grid and an LSM-tree SSTable stack.

Implementing Bloom Filters in LSM-Tree Storage Engines for High-Throughput Key Lookups

Bloom filters are the unsung hero of LSM-tree reads: a few bits per key let engines like RocksDB skip 99% of disk seeks. Here’s the math, the tradeoffs, and what to tune in production.

Stylized ledger book with debits and credits balanced on facing pages.

Architecting Double-Entry Ledger Systems: Schema, Concurrency, and Auditability for Financial Integrity

How to design a double-entry ledger that stays correct under concurrency: event-sourced schema, Postgres constraints, and append-only audit trails.

Diagram of a Bloom filter in front of an LSM-tree sorted run.

Inside LSM-Tree Bloom Filters: Architecture, Trade-offs, and Production Tuning

A deep dive into how Bloom filters accelerate point reads in LSM-tree engines like RocksDB and Cassandra, with the math, the trade-offs, and the levers you actually have at the tuning knob.

Layered diagram of a key-value store with WAL, memtable, SSTables, and compaction.

Building a Mini LSM-Tree Key-Value Store in Rust: A CV-Grade Systems Project

Build a runnable LSM-tree key-value store with a write-ahead log in Rust, from WAL append to SSTable flush to compaction. The exact project to make your CV read like a database engineer’s.