Problems / Caching, hard

Search autocomplete: 40,000 keystrokes a second under 80 ms

Asked at Google and Amazon. Every keystroke runs a prefix query on the full-text search index. Suggestions must come back within 80 ms at p99, and at 8 s a news event raises traffic by half.

Unlock it once for 25 credits; everything inside it is free (runs, changes, Submit, results, hints). Sign in with Google to start; new accounts get free credits.

Your goals

Success ≥ 99.9%, p99 ≤ 80 ms and Apdex ≥ 0.95, for at most $28,000 a month.

Test cases

Like a coding problem, a solution has to pass every case, not just the one it was built for. Submit in the lab runs all 3; 1 of them are hidden until then.

  1. As given. The problem’s own traffic, scheduled failures and seed.
  2. A server dies. One replica of the service with the most replicas is killed for part of the run.

The traffic

40,000 requests a second for 20 seconds: 97% suggest (reads), 3% log (writes).

The system

What each component does in this design, and what calls it. The simulator mimics each one from these settings.

ComponentIts job hereSettings
Load balancerLoad balancerTraffic enters here.Calls Suggest API.Layer 4 balancers route by IP and port; layer 7 balancers read HTTP and can route by path or header.–
Suggest APIApp serviceLoad balancer forwards to it.Calls Full-text index (prefix queries).Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s.16 replicas × 100 slots · timeout 400 ms
Full-text index (prefix queries)Search indexSuggest API calls it.Search engines build an inverted index: each word points to the documents that contain it.512 slots

More caching problems