Presentation on consistent hashing (ARPE)

07 Oct 2019
Tags: computer_science  Here are the sides of a presentation I did on consistent hashing that I did to prepare for my year of reasearch in Pisa. In consistent hashing you want to be able to assign dinamically a set of keys K to a set of buckets,in which they will be stored, and the number of bucket can either increase or decrease at any moment and the keys should be remapped efficiently (less tha K/m remapping in averrage, m being the number of buckets).