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

Hash coding with a non‐unique search key

Author

Listed:
  • Abraham Bookstein

Abstract

This paper defines a hash coding model for non‐unique search keys and derives the expected number of accesses needed to retrieve all desired records from a computer storage device. The assumption that the records are stored on the basis of a non‐unique key is often realized in information retrieval environments. The model assumes that the hashing algorithm and, should a collision occur, the skipping algorithm, both distribute the records randomly in memory. The results of this analysis are compared with those from a simulation in which the randomness criterion is not strictly met.

Suggested Citation

  • Abraham Bookstein, 1974. "Hash coding with a non‐unique search key," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 25(4), pages 232-236, July.
    • Handle: RePEc:bla:jamest:v:25:y:1974:i:4:p:232-236
    DOI: 10.1002/asi.4630250405
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.4630250405
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.4630250405?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:25:y:1974:i:4:p:232-236. 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.