Loading
Pick a focused question that fits your time, stack, and interview goal.
10 results across 1 active filter
Page 1 of 1
Compares server-controlled output caching with HTTP cache semantics and defines safe keys, variation, invalidation, identity, and multi-instance behavior.
Explains how TTL choices balance freshness, load reduction, user expectations, and operational safety.
Compares cache-aside, read-through, and write-through by read and write ownership, freshness, failure behavior, invalidation, fallback, stampede control, and operational complexity.
Compares Redis pub/sub with durable queues when broadcasting cache invalidation or refresh events.
Explains cache-key scope for tenant, user, role, locale, filters, response version, and security-sensitive reads.
Explains when stale cache reads are acceptable, when they are dangerous, and how to make freshness visible.
Explains why cached authorization decisions are risky and how to bound or invalidate permission-related cache safely.
Explains delete-on-write, versioned keys, event-driven invalidation, and the race conditions around cache freshness.
Explains what happens when a hot key expires and how request coalescing, TTL jitter, background refresh, and stale serving help.
Explains the risks of Redis-based distributed locks and when database constraints, queues, or idempotency are safer.