{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T15:15:34Z","timestamp":1673450134569},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1016\/0196-6774(82)90009-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"68-78","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of partial match retrieval in a dynamic setting"],"prefix":"10.1016","volume":"3","author":[{"given":"Michael L","family":"Fredman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis J","family":"Volper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90009-8_BIB1","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/322123.322126","article-title":"Optimality properties of multiple key hashing functions","volume":"26","author":"Bolour","year":"1979","journal-title":"J. Amer. Comput. Mach."},{"key":"10.1016\/0196-6774(82)90009-8_BIB2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/320455.320469","article-title":"Hashing and trie algorithms for partial match retrieval","volume":"1","author":"Burkhard","year":"1976","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0196-6774(82)90009-8_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(81)90099-2","article-title":"Complexity trade-offs for a class of range query problems","volume":"16","author":"Burkhard","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(82)90009-8_BIB4","first-page":"69","article-title":"Probabilistic Methods in Combinatorics","author":"Erdos","year":"1974"},{"key":"10.1016\/0196-6774(82)90009-8_BIB5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0196-6774(81)90009-2","article-title":"The spanning bound as a measure of range query complexity","volume":"2","author":"Fredman","year":"1981","journal-title":"J. Algor."},{"key":"10.1016\/0196-6774(82)90009-8_BIB6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","article-title":"Partial match retrieval algorithms","volume":"5","author":"Rivest","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90009-8_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/360827.360831","article-title":"Attribute based file organization in a paged memory environment","volume":"17","author":"Rothnie","year":"1974","journal-title":"Comm. ACM"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900098?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900098?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:06Z","timestamp":1548744726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["0196677482900098"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90009-8","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}