Interview Bootcamp
Vote

0% completed

​

Data Partitioning

What is data partitioning?

Spreading data across a set of nodes is called data partitioning, and it raises two questions right away.

  1. How do we know which node holds a given piece of data?
  2. When we add or remove nodes, how do we know what data has to move? And how do we keep that movement as small as possible?

A naive approach is to hash the data key to a number. Then find the server by taking that number modulo the total number of servers. For example:

That scheme solves the problem of finding a server to store or retrieve data

.....

.....

.....

Like the course? Get enrolled and start learning!
William Quan

William Quan

· a year ago

Because we could go deeper than just "use consistent hashing w/ densely packed virtual nodes", we could describe the pros and cons of protocols specific to distributed hash tables w/ log(n) lookup times.

Kademlia: XOR distance && implementation details...

Chord: 2^i jump convergence

S

shahidkhan021

· 2 years ago

if my nodes has v nodes 1,3,5,7,11 if my nodes fail can you give me how vnodes in failed nodes will be accessed and how it will be in adding new nodes

Reading Progress

0%

Vote for new content