Sign in
Skip to solution
hardSystem Design

How would you design a distributed key-value store / query cache for search?

663 views
01

Understand the problem

Design a KV query cache with sharding, TTL, thundering-herd and consistency controls for search.

query-cachedistributedkey-valuesearchredisconsistent-hashing
02

Attempt it yourself

Sketch your approach before reading the solution — that's what interviews test.

Nudge consolestandby

Stuck? Beam a request up — the console returns a conceptual nudge that guides your logic without spoiling the implementation.

03

Study the solution

Step 1: Use Cases, Constraints, Assumptions, Back-of-Envelope

Use cases

We'll scope to handle only the core flows that expose the bottlenecks; everything else is deferred.

  • User searches — GET /search?q=..., cache lookup by normalized query hash, hit returns in <20ms, miss fetches search tier.
  • **Servi

Solution ready — 2 min read

Classified // press E to declassify

04

Join the discussion

Discussion (0)

Sign in to join the discussion.

No responses yet. Be the first to share what you think.

Transmission complete // awaiting log

KEEP THE
STREAK ALIVE.

Dossier 62 of 99 decoded in the System Design track. One more won't hurt.

Back to track