Double hashing

Publisher Website
Google Scholar
Abstract
This paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in both, a tree structure is substituted for a linear chain. As developed here, this technique can also be used, with improved efficiency, for storing records with unique keys. To represent both environments, two specific models are defined, analyzed, and compared to conventional methods.

This publication has 6 references indexed in Scilit: