{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:14:56Z","timestamp":1649009696712},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,7,1]],"date-time":"1984-07-01T00:00:00Z","timestamp":457488000000},"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 Processing Letters"],"published-print":{"date-parts":[[1984,7]]},"DOI":"10.1016\/0020-0190(84)90123-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"21-26","source":"Crossref","is-referenced-by-count":2,"title":["On the use of Extendible Hashing without hashing"],"prefix":"10.1016","volume":"19","author":[{"given":"Ulrich","family":"Bechtold","sequence":"first","affiliation":[]},{"given":"Klaus","family":"K\u00fcspert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(84)90123-6_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing \u2014 A fast method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0020-0190(84)90123-6_BIB2","series-title":"Res. Rept. RJ3258","article-title":"On the performance evaluation of extendible hashing and trie searching","author":"Flajolet","year":"1981"},{"issue":"1","key":"10.1016\/0020-0190(84)90123-6_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00263927","article-title":"Storage utilization in B\u2217-trees with a generalized overflow technique","volume":"19","author":"K\u00fcspert","year":"1983","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/0020-0190(84)90123-6_BIB4","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"BIT"},{"key":"10.1016\/0020-0190(84)90123-6_BIB5","first-page":"517","article-title":"Virtual hashing: A dynamically changing hashing","author":"Litwin","year":"1978","journal-title":"4th Internat. Conf. on Very Large Data Bases"},{"issue":"4","key":"10.1016\/0020-0190(84)90123-6_BIB6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/362575.362578","article-title":"Key-to-address transform techniques: A fundamental study on large existing formatted files","volume":"14","author":"Lum","year":"1971","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0020-0190(84)90123-6_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":"ACM Comput. Surveys"},{"issue":"2","key":"10.1016\/0020-0190(84)90123-6_BIB8","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0020-0190(81)90033-8","article-title":"On the average height of trees in digital search and dynamic hashing","volume":"13","author":"Regnier","year":"1981","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0020-0190(84)90123-6_BIB9","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF01932839","article-title":"Order preserving extendible hashing and bucket tries","volume":"21","author":"Tamminen","year":"1981","journal-title":"BIT"},{"issue":"2","key":"10.1016\/0020-0190(84)90123-6_BIB10","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0020-0190(80)90008-3","article-title":"A note on the analysis of extendible hashing","volume":"11","author":"Yao","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(84)90123-6_BIB11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","article-title":"On random 2\u20133 trees","volume":"9","author":"Yao","year":"1978","journal-title":"Acta Inform."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901236?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901236?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:58:14Z","timestamp":1555073894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084901236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,7]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,7]]}},"alternative-id":["0020019084901236"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90123-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,7]]}}}