{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T14:55:09Z","timestamp":1672239309663},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1007\/bf01935368","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T16:48:33Z","timestamp":1122310113000},"page":"477-484","source":"Crossref","is-referenced-by-count":4,"title":["Partial match retrieval using recursive linear hashing"],"prefix":"10.1007","volume":"25","author":[{"given":"K.","family":"Ramamohanarao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sacks-Davis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF01935368_CR1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/320071.320074","volume":"4","author":"A. V. Aho","year":"1979","unstructured":"A. V. Aho and J. D. Ullman,Optimal partial-match retrieval when fields are independently specified, ACM Trans. Database Syst. 4, 2, 1979, 168\u2013179.","journal-title":"ACM Trans. Database Syst."},{"key":"BF01935368_CR2","unstructured":"P.-\u00c5. Larson,Linear hashing with partial expansions. Proc. 6th Int. Conf. on Very Large Data Bases, Montreal, 1980, p. 224\u2013232."},{"key":"BF01935368_CR3","unstructured":"P. \u00c5. Larson,A single file version of linear hashing with partial expansions. Proc. 8th Intl. Conf. on Very Large Data bases, 1982, p. 300\u2013309."},{"key":"BF01935368_CR4","unstructured":"W. Litwin,Linear hashing: a new tool for files and table addressing, Proc. 6th Conf. Very Large Data Bases, Montreal, 1980, 212\u2013223."},{"key":"BF01935368_CR5","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF01944474","volume":"22","author":"J. W. Lloyd","year":"1982","unstructured":"J. W. Lloyd and K. Ramamohanarao,Partial-match retrieval for dynamic files, BIT 22, 1982, 150\u2013168.","journal-title":"BIT"},{"key":"BF01935368_CR6","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF01932837","volume":"21","author":"J. K. Mullin","year":"1981","unstructured":"J. K. Mullin,Tightly controlled linear hashing without separate overflow storage, BIT 21, 1981, 390\u2013400.","journal-title":"BIT"},{"key":"BF01935368_CR7","unstructured":"L. Naish and J. A. Thom,The MU-PROLOG deductive database, Tech. Rep. 83\/10, Dept. Computer Science, University of Melbourne, 1983."},{"issue":"4","key":"BF01935368_CR8","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1093\/comjnl\/25.4.478","volume":"25","author":"K. Ramamohanarao","year":"1982","unstructured":"K. Ramamohanarao and J. W. Lloyd,Dynamic hashing schemes, The Comp. J. vol. 25, No. 4, 1982, 478\u2013485.","journal-title":"The Comp. J."},{"issue":"4","key":"BF01935368_CR9","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/319996.320006","volume":"8","author":"K. Ramamohanarao","year":"1983","unstructured":"K. Ramamohanarao, J. W. Lloyd and J. A. Thom,Partial-match retrieval using hashing and descriptors, ACM Trans. Database Syst. Vol. 8, No. 4, 1983, 552\u2013576.","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"BF01935368_CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/1270.1285","volume":"9","author":"K. Ramamohanarao","year":"1984","unstructured":"K. Ramamohanarao and R. Sacks-Davis,Recursive linear hashing, ACM Trans. Database Syst, Vol. 9, No. 3, 1984, 369\u2013391.","journal-title":"ACM Trans. Database Syst"},{"key":"BF01935368_CR11","series-title":"Technical Report","volume-title":"Partial-match retrieval for dynamic files using linear hashing with partial expansions","author":"K. Ramamohanarao","year":"1985","unstructured":"K. Ramamohanarao and R. Sacks-Davis,Partial-match retrieval for dynamic files using linear hashing with partial expansions, Technical Report 85\/2, The University of Melbourne, Vic., Australia, 1985."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01935368.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01935368\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01935368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:03:23Z","timestamp":1557763403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01935368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["BF01935368"],"URL":"https:\/\/doi.org\/10.1007\/bf01935368","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}