Database Indexing: How Indexes Speed Up Reads (and Cost Writes)
How do database indexes work: the b tree index, clustered vs non clustered indexes, composite index column order,…
Tag
58 articles
How do database indexes work: the b tree index, clustered vs non clustered indexes, composite index column order,…
Sharding vs replication compared: what each mechanism scales, when replication is enough, when to shard, and why production…
Database sharding explained: range, hash, directory, and geographic strategies, choosing a shard key, hot shards, cross-shard queries, and…
Database replication explained: leader-follower, multi-leader, and leaderless topologies, synchronous vs asynchronous trade-offs, replication lag, and the failover failure…
Cache invalidation strategies compared: delete-on-write, versioned cache keys, the cache purge, and write-through vs write-behind (plus the delivery…
Redis architecture under the caching patterns: the single-threaded event loop, redis data structures, maxmemory eviction, rdb vs aof…
Redis caching in practice: cache-aside with a TTL on every write, the redis TTL strategy, and the stampede,…
The three ways caches fail when it matters: the cache stampede on an expired key, cache avalanche from…
Distributed caching beyond one node: consistent-hash routing, cache tiers, hot keys, cross-node invalidation, and the redis vs memcached…
Cache-aside vs read-through, write-through vs write-back, LRU eviction, and the hit-ratio math that decides whether a cache pays…
L4 vs L7 load balancing compared: the layer 4 load balancer's connection-level speed, the layer 7 load balancer's…
Long polling vs SSE compared: how server sent events work, where websockets fit, sse vs polling costs, and…