Interview Bootcamp
Vote

0% completed

​

Data Partitioning

What is data partitioning?

The act of distributing data across a set of nodes is called data partitioning. There are two challenges when we try to distribute data:

  1. How do we know on which node a particular piece of data will be stored?
  2. When we add or remove nodes, how do we know what data will be moved from existing nodes to the new nodes? Furthermore, how can we minimize data movement when nodes join or leave?

A naive approach will be to use a suitable hash function that maps the data key to a number

.....

.....

.....

Like the course? Get enrolled and start learning!
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

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