Abstract

The distribution of keys by a hash function as used in hash search with,chaining is studied by considering the distribution of keys a random function from keys to buckets would give. This. model gives surprisingly simple expressions for the mean value of some statistics on hash functions. It is also seen that the universal hash functions give the same distribution of keys, and so the results here are applicable to them too.