{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:19:30Z","timestamp":1648693170872},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1016\/0020-0255(86)90033-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"187-195","source":"Crossref","is-referenced-by-count":3,"title":["A scheme for constructing ordered minimal perfect hashing functions"],"prefix":"10.1016","volume":"39","author":[{"given":"C.C.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(86)90033-2_BIB1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1147\/sj.22.0086","article-title":"File organization and addressing","volume":"2","author":"Buchholz","year":"1963","journal-title":"IBM Systems J."},{"issue":"3","key":"10.1016\/0020-0255(86)90033-2_BIB2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0020-0255(84)90032-X","article-title":"An ordered minimal perfect hashing scheme based upon Euler's theorem","volume":"32","author":"Chang","year":"1984","journal-title":"Inform. Sci."},{"issue":"4","key":"10.1016\/0020-0255(86)90033-2_BIB3","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/358027.358051","article-title":"The study of an ordered minimal perfect hashing scheme","volume":"27","author":"Chang","year":"1984","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0020-0255(86)90033-2_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/358808.358813","article-title":"Minimal perfect hash functions made simple","volume":"23","author":"Cichelli","year":"1980","journal-title":"Comm. ACM"},{"issue":"9","key":"10.1016\/0020-0255(86)90033-2_BIB5","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/947955.947957","article-title":"A letter oriented minimal perfect hashing function","volume":"17","author":"Cook","year":"1982","journal-title":"Sigplan Notices"},{"issue":"3","key":"10.1016\/0020-0255(86)90033-2_BIB6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TSE.1983.236866","article-title":"The study of a new perfect hash scheme","volume":"SE-9","author":"Du","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0255(86)90033-2_BIB7","first-page":"148","article-title":"Data Base Organization for Data Management","author":"Ghosh","year":"1977"},{"issue":"12","key":"10.1016\/0020-0255(86)90033-2_BIB8","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1145\/358800.358806","article-title":"Reciprocal hashing: A method for generating minimal perfect hashing functions","volume":"24","author":"Jaeschke","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(86)90033-2_BIB9","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/366532.366540","article-title":"An indirect chaining method for addressing on secondary keys","volume":"4","author":"Johnson","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(86)90033-2_BIB10","article-title":"Sorting and Searching","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0255(86)90033-2_BIB11","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/362575.362578","article-title":"Key-to-address transform techniques: A fundamental performance study on large existing formatted files","volume":"14","author":"Lum","year":"1971","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0020-0255(86)90033-2_BIB12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/362851.362880","article-title":"An improved hash code for scatter storage","volume":"11","author":"Maurer","year":"1968","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0020-0255(86)90033-2_BIB13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/362851.362882","article-title":"Scatter storage techniques","volume":"11","author":"Morris","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(86)90033-2_BIB14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/368637.368827","article-title":"Analysis of a file addressing method","volume":"5","author":"Schay","year":"1962","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0020-0255(86)90033-2_BIB15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/356631.356633","article-title":"Identifier search mechanisms: A survey and generalized model","volume":"6","author":"Severance","year":"1974","journal-title":"Comput. Surveys"},{"issue":"11","key":"10.1016\/0020-0255(86)90033-2_BIB16","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/359863.359887","article-title":"Perfect hashing functions: A single probe retrieving method for static sets","volume":"20","author":"Sprugnoli","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(86)90033-2_BIB17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/321172.321178","article-title":"Addressing for random-access storage with multiple bucket capacities","volume":"10","author":"Tainiter","year":"1963","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(86)90033-2_BIB18","series-title":"Proceeding 1983 Conference on Information Sciences and Systems","first-page":"470","article-title":"Single-pass perfect hashing for data storage and retrieval","author":"Yang","year":"1983"},{"key":"10.1016\/0020-0255(86)90033-2_BIB19","unstructured":"C. A. Olson, Random access file organization for indirectly accessed records, Proc. 1969 ACM 24th National Conference, pp. 539\u2013549."},{"key":"10.1016\/0020-0255(86)90033-2_BIB20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1147\/rd.12.0130","article-title":"Addressing for Random-access storage","volume":"1","author":"Peterson","year":"1957","journal-title":"IBM J. Res. and Development"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900332?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900332?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:56:44Z","timestamp":1552913804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025586900332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["0020025586900332"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(86)90033-2","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}