1. What is Sharding ? Mid A. the field whose value decides which node or shard a record is stored on B. a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data C. splitting one logical dataset across multiple machines so each holds only a subset of the rows D. adding more commodity machines to share load, contrasted with buying a single bigger server
2. Which term means: "splitting one logical dataset across multiple machines so each holds only a subset of the rows"? Mid A. Horizontal scaling B. Consistent hashing C. Sharding D. Partition key
3. Which statement is correct? Mid A. Sharding — adding more commodity machines to share load, contrasted with buying a single bigger server B. Sharding — a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data C. Sharding — splitting one logical dataset across multiple machines so each holds only a subset of the rows D. Sharding — the field whose value decides which node or shard a record is stored on
4. What is Partition key ? Junior A. adding more commodity machines to share load, contrasted with buying a single bigger server B. a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field C. the field whose value decides which node or shard a record is stored on D. a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data
5. Which term means: "the field whose value decides which node or shard a record is stored on"? Junior A. Partition key B. Sharding C. Horizontal scaling D. Consistent hashing
6. Which statement is correct? Junior A. Partition key — the field whose value decides which node or shard a record is stored on B. Partition key — a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field C. Partition key — a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data D. Partition key — splitting one logical dataset across multiple machines so each holds only a subset of the rows
7. What is Horizontal scaling ? Junior A. splitting one logical dataset across multiple machines so each holds only a subset of the rows B. adding more commodity machines to share load, contrasted with buying a single bigger server C. the field whose value decides which node or shard a record is stored on D. a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field
8. Which term means: "adding more commodity machines to share load, contrasted with buying a single bigger server"? Junior A. Horizontal scaling B. Sharding C. Hot partition D. Consistent hashing
9. Which statement is correct? Junior A. Horizontal scaling — the field whose value decides which node or shard a record is stored on B. Horizontal scaling — a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field C. Horizontal scaling — a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data D. Horizontal scaling — adding more commodity machines to share load, contrasted with buying a single bigger server
10. What is Consistent hashing ? Senior A. a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field B. a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data C. the field whose value decides which node or shard a record is stored on D. adding more commodity machines to share load, contrasted with buying a single bigger server
11. Which term means: "a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data"? Senior A. Partition key B. Sharding C. Horizontal scaling D. Consistent hashing
12. Which statement is correct? Senior A. Consistent hashing — a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field B. Consistent hashing — a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data C. Consistent hashing — the field whose value decides which node or shard a record is stored on D. Consistent hashing — splitting one logical dataset across multiple machines so each holds only a subset of the rows
13. What is Hot partition ? Senior A. a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field B. the field whose value decides which node or shard a record is stored on C. splitting one logical dataset across multiple machines so each holds only a subset of the rows D. adding more commodity machines to share load, contrasted with buying a single bigger server
14. Which term means: "a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field"? Senior A. Partition key B. Hot partition C. Sharding D. Horizontal scaling
15. Which statement is correct? Senior A. Hot partition — the field whose value decides which node or shard a record is stored on B. Hot partition — a single shard that receives a disproportionate share of traffic because of a poorly chosen distribution field C. Hot partition — splitting one logical dataset across multiple machines so each holds only a subset of the rows D. Hot partition — a placement scheme that maps keys and nodes onto a ring so adding or removing a node moves only a small fraction of data