Dimensioning a multiple hashing scheme

Dimensioning a multiple hashing scheme

0.00 Avg rating0 Votes
Article ID: iaor1998991
Country: United Kingdom
Volume: 34
Issue: 2
Start Page Number: 477
End Page Number: 486
Publication Date: Jun 1997
Journal: Journal of Applied Probability
Authors: ,
Abstract:

The number of items of data which are irretrievable without additional effort after hashing can be greatly reduced if several hash tables are 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.

Reviews

Required fields are marked *. Your email address will not be published.