Quick Search:

is currently disabled due to reindexing of the ZORA database. Please use Advanced Search.
uzh logo
Browse by:
bullet
bullet
bullet
bullet

Zurich Open Repository and Archive 

Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-22227

Barbour, A D; Phatarfod, R (1997). Dimensioning a multiple hashing scheme. Journal of Applied Probability, 34(2):477-486.

[img]
Preview
PDF (Preprint)
1MB

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.

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
DDC:510 Mathematics
Language:English
Date:1997
Deposited On:08 Apr 2010 13:26
Last Modified:27 Nov 2013 16:20
Publisher:Applied Probability Trust
ISSN:0021-9002
Publisher DOI:10.2307/3215386
Related URLs:http://www.jstor.org/stable/3215386
Citations:Web of Science®
Google Scholar™

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page