IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v23y1972i6p402-405.html
   My bibliography  Save this article

Double hashing

Author

Listed:
  • Abraham Bookstein

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.

Suggested Citation

  • Abraham Bookstein, 1972. "Double hashing," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 23(6), pages 402-405, November.
    • Handle: RePEc:bla:jamest:v:23:y:1972:i:6:p:402-405
    DOI: 10.1002/asi.4630230610
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.4630230610
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.4630230610?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:23:y:1972:i:6:p:402-405. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.