{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:07:07Z","timestamp":1759961227733,"version":"build-2065373602"},"reference-count":7,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T00:00:00Z","timestamp":1174521600000},"content-version":"vor","delay-in-days":12559,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Am. Soc. Inf. Sci."],"published-print":{"date-parts":[[1972,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper generalizes the direct\u2010chaining technique of hash coding in a manner that is useful for storing records on the basis of non\u2010unique 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.<\/jats:p>","DOI":"10.1002\/asi.4630230610","type":"journal-article","created":{"date-parts":[[2007,6,27]],"date-time":"2007-06-27T15:27:40Z","timestamp":1182958060000},"page":"402-405","source":"Crossref","is-referenced-by-count":3,"title":["Double hashing"],"prefix":"10.1002","volume":"23","author":[{"given":"Abraham","family":"Bookstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,22]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"Gustafson RichardA. Elements of the Randomized Combination File Structure inMinker J.(Ed.) Proceedings of the Symposium on Information Storage and Retrieval (April1\u20132 1971)163\u2013174.","DOI":"10.1145\/511285.511304"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/362919.362934"},{"key":"e_1_2_1_4_2","first-page":"79","article-title":"Retrieval of Bibliographic Entries from a Name\u2010Title Catalog by Use of Truncated Search Keys","volume":"7","author":"Kilgour F. S.","year":"1970","journal-title":"Proceedings of the American Society for Information Science"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630220603"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/362851.362882"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/366532.366540"},{"key":"e_1_2_1_8_2","first-page":"54","volume-title":"Art of Computer Programming","author":"Knuth D. E.","year":"1968"}],"container-title":["Journal of the American Society for Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fasi.4630230610","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/asi.4630230610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T12:32:57Z","timestamp":1759926777000},"score":1,"resource":{"primary":{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/10.1002\/asi.4630230610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,11]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1972,11]]}},"alternative-id":["10.1002\/asi.4630230610"],"URL":"https:\/\/doi.org\/10.1002\/asi.4630230610","archive":["Portico"],"relation":{},"ISSN":["0002-8231","1097-4571"],"issn-type":[{"type":"print","value":"0002-8231"},{"type":"electronic","value":"1097-4571"}],"subject":[],"published":{"date-parts":[[1972,11]]}}}