{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:10:05Z","timestamp":1750180205342,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[1984,7,1]],"date-time":"1984-07-01T00:00:00Z","timestamp":457488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[1984,7]]},"abstract":"<jats:p>\n            <jats:italic>A new file organization method that guarantees retrieval of any record in one access is tested on two existing files, producing empirical results that compare favorably with theoretical predictions. The description of the method includes the algorithms used for implementing the required hashing and signature functions.<\/jats:italic>\n          <\/jats:p>","DOI":"10.1145\/358105.358193","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:34:59Z","timestamp":1027769699000},"page":"670-677","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["File organization"],"prefix":"10.1145","volume":"27","author":[{"given":"Per-\u00c5ke","family":"Larson","sequence":"first","affiliation":[{"name":"Univ. of Waterloo, Waterloo, ONT., Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay","family":"Kajla","sequence":"additional","affiliation":[{"name":"SUNY, Old Westbury, Old Westbury, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1984,7]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/588111.588153"},{"key":"e_1_2_1_2_2","volume-title":"The Art of Computer Programming","author":"Knuth D.E.","year":"1981","unstructured":"Knuth , D.E. The Art of Computer Programming . Vol. 2 , Seminumerical Algorithms. 2 nd ed. Addison-Wesley , Reading, Mass., 1981 . Chapter 3 contains a thorough discussion of methods for generating and testing random numbers. Knuth, D.E. The Art of Computer Programming. Vol. 2, Seminumerical Algorithms. 2nd ed. Addison-Wesley, Reading, Mass., 1981. Chapter 3 contains a thorough discussion of methods for generating and testing random numbers.","edition":"2"},{"key":"e_1_2_1_3_2","volume-title":"The Art of Computer Programming","author":"Knuth D.E.","year":"1973","unstructured":"Knuth , D.E. The Art of Computer Programming . Vol. 3 , Sorting and Searching. Addison-Wesley , Reading, Mass., 1973 . Section 6.4 discusses hashing, and in particular, double hashing. Knuth, D.E. The Art of Computer Programming. Vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass., 1973. Section 6.4 discusses hashing, and in particular, double hashing."},{"key":"e_1_2_1_4_2","volume-title":"Further analysis of external hashing with fixed-length separators. Rep. CS-83-18","author":"Larson P.-A.","year":"1983","unstructured":"Larson , P.-A. Further analysis of external hashing with fixed-length separators. Rep. CS-83-18 , Univ. of Waterloo , Waterloo, Ont ., Canada, 1983 . A continuation of {1}. An analysis of the insertion costs of the method studied in this paper. Larson, P.-A. Further analysis of external hashing with fixed-length separators. Rep. CS-83-18, Univ. of Waterloo, Waterloo, Ont., Canada, 1983. A continuation of {1}. An analysis of the insertion costs of the method studied in this paper."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/358105.358193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/358105.358193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:19Z","timestamp":1750178179000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/358105.358193"}},"subtitle":["implementation of a method guaranteeing retrieval in one access"],"short-title":[],"issued":{"date-parts":[[1984,7]]},"references-count":4,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1984,7]]}},"alternative-id":["10.1145\/358105.358193"],"URL":"https:\/\/doi.org\/10.1145\/358105.358193","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[1984,7]]},"assertion":[{"value":"1984-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}