Dynamic Hashing Schemes

Open Access
Publisher Website
Google Scholar
Abstract
In this paper, we study two new dynamic hashing schemes for primary key retrieval. The schemes are related to those of Scholl, Litwin and Larson. The first scheme is simple and elegant and has certain performance advantages over earlier schemes. We give a detailed mathematical analysis of this scheme and also present simulation results. The second scheme is essentially that of Larson. However, we have made a number of changes which simplify his scheme.

This publication has 0 references indexed in Scilit: