Double hashing

Abraham Bookstein

Journal of the American Society for Information Science, 1972, vol. 23, issue 6, 402-405

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.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.4630230610

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:23:y:1972:i:6:p:402-405

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().