{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:50:17Z","timestamp":1648857017736},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":[[1981,1]]},"DOI":"10.1016\/0306-4379(81)90036-3","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"139-146","source":"Crossref","is-referenced-by-count":1,"title":["Key compression using segment strings"],"prefix":"10.1016","volume":"6","author":[{"given":"C.L.","family":"Lam","sequence":"first","affiliation":[]},{"given":"Z.G.","family":"Vranesic","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(81)90036-3_BIB1","volume":"vol. 3","author":"Knuth","year":"1975","journal-title":"The Art of Computer Programming"},{"key":"10.1016\/0306-4379(81)90036-3_BIB2","series-title":"Computer Data-Base Organization","author":"Martin","year":"1975"},{"key":"10.1016\/0306-4379(81)90036-3_BIB3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1147\/sj.22.0086","article-title":"File organization and addressing","volume":"2","author":"Bucholz","year":"1963","journal-title":"IBM System J."},{"key":"10.1016\/0306-4379(81)90036-3_BIB4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/361952.361964","article-title":"Reducing the retrieval time of scatter storage techniques","volume":"16","author":"Brent","year":"1972","journal-title":"CACM"},{"key":"10.1016\/0306-4379(81)90036-3_BIB5","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1145\/359545.359560","article-title":"Pseudochaining in hash tables","volume":"21","author":"Halatsis","year":"1978","journal-title":"CACM"},{"key":"10.1016\/0306-4379(81)90036-3_BIB6","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/359863.359887","article-title":"Perfect hashing functions: a single probe retrieving methods for static sets","volume":"20","author":"Sprugnoli","year":"1977","journal-title":"CACM"},{"key":"10.1016\/0306-4379(81)90036-3_BIB7","article-title":"A proposal for efficient file addressing techniques","author":"Lam","year":"1979"},{"key":"10.1016\/0306-4379(81)90036-3_BIB8","first-page":"1507","article-title":"An experimental study of the possible bandwidth compression of visual image signals","volume":"51","author":"Cherry","year":"1963"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437981900363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437981900363?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:51:48Z","timestamp":1552625508000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437981900363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["0306437981900363"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(81)90036-3","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}