{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:03:48Z","timestamp":1648526628675},"reference-count":24,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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 Systems"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0306-4379(92)90032-i","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"359-380","source":"Crossref","is-referenced-by-count":1,"title":["Linear-density hashing with dynamic overflow sharing"],"prefix":"10.1016","volume":"17","author":[{"given":"Murlidhar","family":"Koushik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Diehr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(92)90032-I_BIB1","series-title":"Proc. 4th Conf. on Very Large Data Bases","first-page":"517","article-title":"Virtual hashing: a dynamically changing hashing scheme","author":"Litwin","year":"1978"},{"issue":"2","key":"10.1016\/0306-4379(92)90032-I_BIB2","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"BIT"},{"issue":"4","key":"10.1016\/0306-4379(92)90032-I_BIB3","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1093\/comjnl\/25.4.478","article-title":"Dynamic hashing schemes","volume":"25","author":"Ramamohanrao","year":"1981","journal-title":"Comput. J."},{"issue":"3","key":"10.1016\/0306-4379(92)90032-I_BIB4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing\u2014a fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Syst."},{"issue":"5","key":"10.1016\/0306-4379(92)90032-I_BIB5","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TSE.1982.236022","article-title":"Analysis of extendible hashing","volume":"SE-8","author":"Mendelson","year":"1982","journal-title":"IEEE Trans. Software Engng"},{"issue":"8","key":"10.1016\/0306-4379(92)90032-I_BIB6","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TSE.1986.6312983","article-title":"Dynamic file structure for partial match retrieval based on overflow bucket sharing","volume":"SE-12","author":"Yuen","year":"1986","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0306-4379(92)90032-I_BIB7","series-title":"Proc. 6th Conf. on Very Large Data Bases","first-page":"224","article-title":"Linear hashing with partial expansions","author":"Larson","year":"1980"},{"issue":"4","key":"10.1016\/0306-4379(92)90032-I_BIB8","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1145\/319758.319763","article-title":"Performance analysis of linear hashing with partial expansions","volume":"7","author":"Larson","year":"1982","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10.1016\/0306-4379(92)90032-I_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/3148.3324","article-title":"Linear hashing with overflow handling by linear probing","volume":"10","author":"Larson","year":"1985","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"10.1016\/0306-4379(92)90032-I_BIB10","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/44498.44500","article-title":"Linear hashing with separators\u2014a dynamic hashing scheme achieving one-access retrieval","volume":"13","author":"Larson","year":"1988","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0306-4379(92)90032-I_BIB11","series-title":"Proc. 6th Conf. on Very Large Data Bases","first-page":"212","article-title":"Linear hashing: a new tool for file and table addressing","author":"Litwin","year":"1980"},{"issue":"3","key":"10.1016\/0306-4379(92)90032-I_BIB12","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/1270.1285","article-title":"Recursive linear hashing","volume":"9","author":"Ramamohanrao","year":"1984","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0306-4379(92)90032-I_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/46157.330532","article-title":"Dynamic hashing schemes","volume":"20","author":"Enbody","year":"1988","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0306-4379(92)90032-I_BIB14","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF01932837","article-title":"Tightly controlled linear hashing without separate overflow area","volume":"21","author":"Mullin","year":"1981","journal-title":"BIT"},{"key":"10.1016\/0306-4379(92)90032-I_BIB15","article-title":"Spiral storage: incrementally augmentable hash addressed storage","author":"Martin","year":"1979"},{"issue":"3","key":"10.1016\/0306-4379(92)90032-I_BIB16","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1093\/comjnl\/28.3.330","article-title":"Spiral storage: efficient dynamic hashing with constant performance","volume":"28","author":"Mullin","year":"1985","journal-title":"Comput. J."},{"issue":"1","key":"10.1016\/0306-4379(92)90032-I_BIB17","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/319830.319837","article-title":"Bounded index exponential hashing","volume":"8","author":"Lomet","year":"1983","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10.1016\/0306-4379(92)90032-I_BIB18","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/319540.319564","article-title":"New file organizations based on dynamic hashing","volume":"6","author":"Scholl","year":"1981","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0306-4379(92)90032-I_BIB19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0306-4379(92)90032-I_BIB20","series-title":"File Structures: An Analytic Approach","author":"Salzberg","year":"1988"},{"key":"10.1016\/0306-4379(92)90032-I_BIB21","article-title":"Linear-density hashing with dynamic overflow sharing","author":"Koushik","year":"1989"},{"key":"10.1016\/0306-4379(92)90032-I_BIB22","series-title":"Analysis of Inventory Systems","author":"Hadley","year":"1963"},{"key":"10.1016\/0306-4379(92)90032-I_BIB23","volume":"Vol. 1","author":"Feller","year":"1957"},{"issue":"10","key":"10.1016\/0306-4379(92)90032-I_BIB24","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1145\/63039.63042","article-title":"Random number generators: good ones are hard to find","volume":"31","author":"Park","year":"1988","journal-title":"Commun. ACM"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643799290032I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643799290032I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:55:46Z","timestamp":1552625746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030643799290032I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["030643799290032I"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(92)90032-i","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}