Smart hashing with minimized conflicting on high frequency items

11 Views Asked by At

I was thinking of hashing N items to K buckets, with the hope that the conflicting on high frequency items are minimized (pushing the conflicting to the buckets with less items). Is there some existing algorithm that can achieve this?

1

There are 1 best solutions below

0
On

You might want to look at Cuckoo Hashing.