The number of items of data which are irretrievable without additional
effort after hashing can be greatly reduced if several hash tables ar
e used simultaneously. Here we show that, in a multiple hashing scheme
, this number has a distribution very close to Poisson. Thus choosing
the number and sizes of the tables to minimize the expected number of
irretrievable items is the right way to dimension a scheme.