{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:16:20Z","timestamp":1672262180648},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"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,6]]},"DOI":"10.1016\/0020-0255(86)90024-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"243-255","source":"Crossref","is-referenced-by-count":3,"title":["Letter-oriented reciprocal hashing scheme"],"prefix":"10.1016","volume":"38","author":[{"given":"C.C.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"no. 3","key":"10.1016\/0020-0255(86)90024-1_BIB1","doi-asserted-by":"crossref","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)90024-1_BIB2","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)90024-1_BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/358808.358813","article-title":"Minimal perfect hash function made simple","volume":"23","author":"Cichelli","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(86)90024-1_BIB4","series-title":"Data Base Organization for Data Management","author":"Ghosh","year":"1977"},{"issue":"12","key":"10.1016\/0020-0255(86)90024-1_BIB5","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"},{"issue":"12","key":"10.1016\/0020-0255(86)90024-1_BIB6","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1145\/359038.3084011","article-title":"On Cichelli's minimal perfect hash functions method","volume":"23","author":"Jaeschke","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(86)90024-1_BIB7","series-title":"Advances in Information Systems Sciences","author":"Tou","year":"1981"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900241?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900241?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T12:09:03Z","timestamp":1623154143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025586900241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0020025586900241"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(86)90024-1","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}