How jemalloc Balances Arenas Against Thread Caches
A deep dive into jemalloc’s arena‑vs‑thread‑cache design, its runtime balancing algorithm, and practical tuning tips for developers.
Posts
How Path Compression Flattens the Union-Find Tree Structure
Path compression dramatically speeds up Union-Find operations by collapsing intermediate nodes during finds, turning deep trees into almost flat structures.
How CRDTs Reconcile Concurrent Edits Without a Central Server
An in‑depth look at the mathematics and engineering behind CRDTs that enable seamless, server‑less collaborative editing.
When Reader-Writer Locks Leave Your Writers Starving
Reader‑writer locks promise high concurrency for reads but can silently starve writers. This post explains why, how to spot it, and practical fixes.
Why Query Planners Fail at Cardinality Estimation
A deep dive into the reasons query planners stumble on cardinality estimation, from outdated statistics to optimizer assumptions, and how to mitigate the impact.