← Quit0 / 0 correct
Search engine design: how is a query answered over billions of documents in ~100 ms?
query ─▶ root ─┬─▶ shard 1 (top-k)
├─▶ shard 2 (top-k)
└─▶ shard N (top-k)
merge top-k ◀────┘Search engine design: how is a query answered over billions of documents in ~100 ms?
query ─▶ root ─┬─▶ shard 1 (top-k)
├─▶ shard 2 (top-k)
└─▶ shard N (top-k)
merge top-k ◀────┘