The cache owns the miss path: schematic.
Read-through caching gives callers one reading interface: a hit returns a stored value, while a miss invokes a loader and stores its result. The important boundary is who owns that loader. Moving it behind the cache interface can remove duplicated lookup logic, but does not automatically solve concurrency, writes, authorization, or consistency between independent copies. ...
Replay needs retained records: schematic.
A Redis stream stores entries under ordered IDs so readers can revisit retained history. Unlike Pub/Sub, the reader need not be online when the producer appends. That difference provides replay, not unconditional durability: deleted entries, retention limits, and persistence settings still determine what remains available after delay or failure. ...
A Redis bitmap is a string interpreted as individual bits, not a separate key type. It is useful for dense yes/no membership such as daily activity. Ten million contiguous flags need 1,250,000 payload bytes, but that estimate excludes keys, object metadata, allocation overhead, and any mapping from business identifiers to bit positions. ...
A Redis list is an ordered sequence of byte values with operations at both ends. Choosing the push and pop ends determines whether it behaves as a queue or a stack. Blocking operations wait for data; they are not distributed locks, acknowledgements, or a complete message-processing protocol. ...
A Redis transaction is a connection-scoped command queue followed by an isolated execution window. MULTI starts the queue; EXEC runs accepted commands in order. The useful guarantee is that another client’s commands cannot run between those operations. It is not a promise to undo successful writes when a later command fails. ...
A Redis sorted set stores unique byte-string members, each associated with a numeric score. Scores determine order; they need not be unique. This supports leaderboards and time-based indexes, but it does not make score values into automatic expiration deadlines. Model membership, ranking, and cleanup as distinct operations with explicit boundaries. ...
A hash groups fields: schematic.
A Redis hash maps field names to byte values under one key. It fits an entity whose attributes are read or changed independently, such as a profile with a name and score. HGET and HSET each operate in one command; using a hash does not inherently add a second network hop compared with a string. ...
Pub/Sub has no replay: schematic.
Redis Pub/Sub broadcasts to subscriptions that are active when a message is published. It does not retain an inbox for a disconnected listener. This suits replaceable live notifications, but a positive PUBLISH response is not evidence that a worker finished a job or that an offline consumer can recover it. ...