5 ms·
It depends on how you do it. If you assign values to a ring and have nodes cover adjacent items on the ring (node A is primary for n, secondary for n+1 and n-1)
by zeckalpha 5y ago
It depends on how you do it. If you assign values to a ring and have nodes cover adjacent items on the ring (node A is primary for n, secondary for n+1 and n-1), then the rebalancing is much more efficient and can happen in the background.
- almog 5y agoWhat you're describing is Consistent Hashing. It is a mean to _assign partitions to nodes_ and it is independent of how you partition your _data_ (though it's typically used with hash based partitioning of th edata). At any rate, the way I understood it, the article described partitioning of the data by `key mod k`, k being the current number of nodes.