{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:51:49Z","timestamp":1649181109283},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"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 and Software Technology"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0950-5849(02)00174-x","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T20:45:15Z","timestamp":1043959515000},"page":"109-112","source":"Crossref","is-referenced-by-count":2,"title":["Empirical studies of some hashing functions"],"prefix":"10.1016","volume":"45","author":[{"given":"Olumide","family":"Owolabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0950-5849(02)00174-X_BIB1","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1002\/spe.4380191005","article-title":"Near-perfect hashing for large word sets","volume":"19","author":"Brain","year":"1989","journal-title":"Software\u2014Practice Experience"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0020-0255(86)90033-2","article-title":"A scheme for constructing ordered minimal perfect hashing functions","volume":"39","author":"Chang","year":"1986","journal-title":"Info. Sci."},{"key":"10.1016\/S0950-5849(02)00174-X_BIB3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1093\/comjnl\/28.1.54","article-title":"Practical perfect hashing","volume":"28","author":"Cormack","year":"1985","journal-title":"Comput. J."},{"key":"10.1016\/S0950-5849(02)00174-X_BIB4","article-title":"The art of computer programming","volume":"vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB5","series-title":"Content\u2014Assressable Memories","author":"Kohonen","year":"1987"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB6","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/362375.362385","article-title":"General performance analysis of key-to-address transformation methods using an abstract file concept","volume":"16","author":"Lum","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/356643.356645","article-title":"Hash table methods","volume":"7","author":"Maurer","year":"1975","journal-title":"Comput. Surv."},{"key":"10.1016\/S0950-5849(02)00174-X_BIB8","series-title":"File structures using pascal","author":"Miller","year":"1987"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB9","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":"Commun. ACM"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/382086.382626","article-title":"Minimal perfect hash functions for reserved word lists","volume":"20","author":"Sebasta","year":"1985","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB11","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/359863.359887","article-title":"Perfect hashing functions: a single probe method for static sets","volume":"20","author":"Sprugnoli","year":"1977","journal-title":"Commun. ACM"},{"key":"10.1016\/S0950-5849(02)00174-X_BIB12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321707.321722","article-title":"A note on the efficiency of hashing functions","volume":"19","author":"Ullman","year":"1972","journal-title":"J. ACM"}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095058490200174X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095058490200174X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T13:26:50Z","timestamp":1554211610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095058490200174X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S095058490200174X"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(02)00174-x","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}