What is the purpose of the Linear Hashing Partial Extension algorithm?

Question

Hashing

Good evening, maybe someone has come across this algorithm and can explain what it is. There is a lot of material in English, but, unfortunately, I do not speak it at such a level that I can catch all the mechanics and nuances. If someone wants to help, let me know in the comments, I will attach a pdf document with an explanation in English.
Thanks in advance.

Answer 1

It's the old idea of ​​splitting those bins in the hash table that have populations above a given limit, and instead merge them into two bins that are small enough to form a pair. This approach forced us to try different versions of the hash function during operations on the table until (not) reaching a hit.
Now the mainstream approach is different - when the size of the table exceeds a certain limit (size in elements, not in baskets), it is repartitioned into, say, twice as many baskets, and the limit doubles. And vice versa. The hash function is the same for all baskets, it's easier, faster.
LHCHR was valuable because its inventor gave a strict analytical estimate of the speed of operations, which was not the case for other algorithms. Since then, the amortized estimates of the other methods have been calculated, they are just as good asymptotically, but in practice they are much faster. Hashes have learned how to cook correctly, in general, they have become wiser.