Virtual Labs

Consistent hashing

What is a distributed hash table (DHT)?

a: A single table stored in a single computer's memory Explanation

Explanation

b: A table of key-value pairs stored across multiple computers Explanation

Explanation

c: A table stored in a relational database Explanation

Explanation

d: A hash table with a fixed size Explanation

Explanation

How does naive hashing distribute key-value pairs across a cluster?

a: By randomly selecting a machine Explanation

Explanation

b: By using the modulo operation on the hash of the key and the number of machines Explanation

Explanation

c: By storing all keys in a single machine Explanation

Explanation

d: By storing keys alphabetically across machines Explanation

Explanation

What is the primary purpose of a hash function in distributed systems?

a: To encrypt sensitive data Explanation

Explanation

b: To map keys to specific storage locations Explanation

Explanation

c: To compress large files Explanation

Explanation

d: To sort data alphabetically Explanation

Explanation

What is a major drawback of the naive hashing method when adding a new machine to the cluster?

a: It increases the number of hash collisions Explanation

Explanation

b: It does not allow for even distribution of keys Explanation

Explanation

c: It requires recomputing the hash of all keys, leading to massive data movement Explanation

Explanation

d: It reduces the total storage capacity Explanation

Explanation

What is the main advantage of consistent hashing over naive hashing in distributed systems?

a: It eliminates the need for hashing altogether Explanation

Explanation

b: It minimizes data movement when nodes are added or removed Explanation

Explanation

c: It stores all data on a single node Explanation

Explanation

d: It increases the number of hash collisions Explanation

Explanation

In consistent hashing, what is a 'virtual node'?

a: A node that does not store any data Explanation

Explanation

b: A logical partition of a physical node to improve load balancing Explanation

Explanation

c: A node that is always offline Explanation

Explanation

d: A node that stores all keys Explanation

Explanation

What is the hash ring in consistent hashing?

a: A circular data structure where nodes and keys are placed based on their hash values Explanation

Explanation

b: A linear array of all hash values Explanation

Explanation

c: A tree structure for organizing nodes Explanation

Explanation

d: A table containing all possible hash values Explanation

Explanation

How does consistent hashing handle the 'hot spot' problem in distributed systems?

a: By storing all data on the fastest node Explanation

Explanation

b: By using virtual nodes to distribute load more evenly across physical nodes Explanation

Explanation

c: By replicating all data on every node Explanation

Explanation

d: By randomly redistributing keys every hour Explanation

Explanation

In a consistent hashing implementation with replication factor R, how many nodes will store a copy of any given key?

a: 1 node Explanation

Explanation

b: All nodes in the system Explanation

Explanation

c: R nodes (the next R nodes clockwise on the ring) Explanation

Explanation

d: R*2 nodes for redundancy Explanation

Explanation