The building blocks — what they are and when to reach for them.
An in-memory data store used as a cache, session store, rate limiter, and message broker — microsecond reads.
A distributed, append-only commit log that streams high-throughput events across partitions with durable, replayable storage and consumer-group scaling.
A traditional message broker that routes messages through exchanges to queues using bindings, with acknowledgements and flexible work-queue patterns.
A component that distributes incoming traffic across multiple servers using health checks and balancing algorithms, operating at L4 (transport) or L7 (application).
A globally distributed network of edge servers that caches static content near users to cut latency and offload the origin, using origin pull and TTL-based freshness.
The internet's naming system that resolves human-readable domains to IP addresses via recursive and authoritative resolvers, records, and TTL-based caching.
Storing hot data in a faster, closer layer to cut latency and load, governed by hit ratio, eviction policies like LRU, and the hard problem of invalidation.
Copying data across multiple nodes for read scaling and high availability, using leader-follower or multi-leader topologies with synchronous or asynchronous propagation.
Horizontal partitioning that spreads rows of one logical dataset across many independent nodes, using a shard key to route each request to the node that owns the data.
Splitting a large table or dataset into smaller pieces — horizontally by rows or vertically by columns — to improve manageability and performance, often within a single system.
A hashing scheme that maps keys and nodes onto a ring so that adding or removing a node remaps only a small fraction of keys, avoiding the mass reshuffle of modulo hashing.
A space-efficient probabilistic data structure that answers set-membership queries with no false negatives and a tunable false-positive rate, used to skip expensive lookups.
In a distributed system, a network partition forces a choice between consistency and availability — you cannot have both while partitioned; PACELC adds the latency-vs-consistency tradeoff in normal operation.
A voting rule for replicated systems: requiring read and write sets to overlap (R + W > N) guarantees reads see the latest write, giving tunable consistency in Dynamo-style stores.
The process by which distributed nodes agree on a single coordinator to serialize decisions, using consensus (Raft, Paxos, ZooKeeper) and safeguards against split-brain and failover gaps.