{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:51:42Z","timestamp":1649065902968},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0164-1212(98)10089-4","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T02:09:52Z","timestamp":1049508592000},"page":"77-88","source":"Crossref","is-referenced-by-count":1,"title":["A displacement addressing method for letter-oriented keys"],"prefix":"10.1016","volume":"46","author":[{"given":"Shiuh-Jeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinn-Ke","family":"Jan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0164-1212(98)10089-4_BIB1","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\/S0164-1212(98)10089-4_BIB2","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."},{"key":"10.1016\/S0164-1212(98)10089-4_BIB3","unstructured":"Ghosh, S.P., 1977. Data Base Organization for Data Management. Academic Press, New York"},{"issue":"12","key":"10.1016\/S0164-1212(98)10089-4_BIB4","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1145\/358800.358806","article-title":"Reciprocal hashing: A method for generating minimal perfect function","volume":"24","author":"Jaeschke","year":"1981","journal-title":"Comm. ACM."},{"key":"10.1016\/S0164-1212(98)10089-4_BIB5","doi-asserted-by":"crossref","unstructured":"Lewis, T.G., Cook, C.R., 1988. Hashing for dynamic and static internal tables. IEEE Computers pp. 45\u201356","DOI":"10.1109\/2.7056"},{"key":"10.1016\/S0164-1212(98)10089-4_BIB6","unstructured":"Long, C.T., 1967. Elementary Introduction Tonumber Theory. Heath, Boston"},{"key":"10.1016\/S0164-1212(98)10089-4_BIB7","unstructured":"Sierpinski, W., 1964. A Selection of Problems in the Theory of Numbers. Pergamon Press, London"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121298100894?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121298100894?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T08:15:22Z","timestamp":1578644122000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121298100894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0164121298100894"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(98)10089-4","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}