codejump

Large-Scale Architecture — Series 3

Preview — 3 of 10 questions

A search index is rebuilt while source writes continue. A new index has the same document count as the old one. What evidence is needed before switching the read alias?

AA successful query for the oldest document in each index.
BCatch up to a defined change boundary and validate content.
CEqual counts alone, because they imply identical documents.
DA lower average query latency on the new index.

A large file is uploaded as independently retried parts. What should make the completed object visible to readers?

AA client-side success toast before the server verifies the manifest.
BCommit a manifest after verifying all parts and checksums.
CThe arrival of whichever numbered part happens to arrive last.
DThe first successful part upload, with missing bytes read as zero.

Records are split across shards, each record belongs to one shard, and all use the same total ranking order. To find the exact global top 10, what is sufficient?

AMerge only each shard's single highest-ranked record.
BAverage each shard's top score and choose the nearest records.
CMerge each shard's local top 10 and select the global top 10.
DTake ten records from the shard with the highest maximum.

Sign up free to play

Answer all 10 questions (7 more), see explanations for every answer, and track your score.