Building a Pure Python HNSW Vector Index with Disk Persistence
Learn to implement a hierarchical navigable small world graph from scratch in Python, with persistence and incremental updates, to impress hiring managers.
Databases
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.
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.
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.
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.