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.
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.
Optimizing RocksDB LSM-Tree Compaction: Strategies for Write Amplification and Storage Efficiency
How RocksDB’s compaction strategies trade off write amplification, read amplification, and space amplification — and how to tune them for real workloads.
Optimizing Small Language Models for Local Edge Inference: Quantization, Pruning, and Runtime Tuning
A field guide to running small language models locally on CPUs, NPUs, and modest GPUs. Covers INT4/INT8 quantization, structured and unstructured pruning, KV-cache tuning, batching, and how to measure what actually matters.
Building a Distributed Token Bucket Rate Limiter in Go with Redis: A CV-Ready Microservice Project
Build a production-shaped distributed rate limiter in Go and Redis using a token bucket algorithm. Includes runnable code, atomic Lua scripts, integration tests, and a roadmap to extend it for your CV.