{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:49:31Z","timestamp":1761580171280},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1016\/0022-0000(84)90020-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"379-394","source":"Crossref","is-referenced-by-count":57,"title":["New trie data structures which support very fast search operations"],"prefix":"10.1016","volume":"28","author":[{"given":"Dan E.","family":"Willard","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90020-5_BIB1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(84)90020-5_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(84)90020-5_BIB3","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","article-title":"Trie Memory","volume":"3","author":"Fredkin","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90020-5_BIB4","series-title":"Proceedings of the 23rd IEEE Symposium on the Foundations of Computer Science","first-page":"165","article-title":"Storing a space table with O(1) worst case access times","author":"Fredman","year":"1982"},{"key":"10.1016\/0022-0000(84)90020-5_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00288534","article-title":"An algorithmic and complexity analysis of interpolation search","volume":"13","author":"Gonnet","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(84)90020-5_BIB6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01786986","article-title":"A priority queue in which initialization and queue operations take O(log log D) time","volume":"15","author":"Johnson","year":"1982","journal-title":"Math. System Theory"},{"key":"10.1016\/0022-0000(84)90020-5_BIB7","author":"Knuth","year":"1973"},{"key":"10.1016\/0022-0000(84)90020-5_BIB8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1008328.1008329","article-title":"Big omicron, big omega, and big theta","volume":"8","author":"Knuth","year":"1976","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(84)90020-5_BIB9","author":"Knuth","year":"1979","journal-title":"Widely disseminated classroom notes on stratified trees"},{"key":"10.1016\/0022-0000(84)90020-5_BIB10","unstructured":"R. Karlson, Unpublished notes, University of Waterloo, 1982."},{"key":"10.1016\/0022-0000(84)90020-5_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary search trees of bounded balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90020-5_BIB12","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/359545.359557","article-title":"Interpolation search\u2014A log log N search","volume":"21","author":"Pearl","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90020-5_BIB13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(77)90072-2","article-title":"Understanding the complexity of interpolation search","volume":"6","author":"Pearl","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(84)90020-5_BIB14","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/359168.359175","article-title":"Storing a sparse table","volume":"22","author":"Tarjan","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(84)90020-5_BIB15","series-title":"Proceedings of the 16th Annual Symposium on the Foundations of Computer Science","first-page":"75","article-title":"Preserving order in a forest in less than logarithmic time","author":"Van Emde Boas","year":"1975"},{"key":"10.1016\/0022-0000(84)90020-5_BIB16","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"Van Emde Boas","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(84)90020-5_BIB17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"Van Emde Boas","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(84)90020-5_BIB18","first-page":"1","article-title":"A log log N search algorithm for nonuniform distributions","volume":"Vol. 11","author":"Willard","year":"1981"},{"key":"10.1016\/0022-0000(84)90020-5_BIB19","unstructured":"D. E. Willard, Searching nonuniformly generated files in log log N runtime, SIAM J. Comput., in press."},{"key":"10.1016\/0022-0000(84)90020-5_BIB20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0211012","article-title":"Polygon retrieval","volume":"11","author":"Willard","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90020-5_BIB21","series-title":"Proceeding of the 19th Annual Allerton Conference on Communications, Control, and Computing","first-page":"335","article-title":"Two very fast trie data structures","author":"Willard","year":"1981"},{"key":"10.1016\/0022-0000(84)90020-5_BIB22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","article-title":"Log-logarithmic worst-case range queries are possible in space O(N)","volume":"17","author":"Willard","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(84)90020-5_BIB23","series-title":"Proceeding of the 20th Annual Allerton Conference on Communications, Control, and Computing","first-page":"462","article-title":"A new time complexity for orthogonal range queries","author":"Willard","year":"1982"},{"key":"10.1016\/0022-0000(84)90020-5_BIB24","doi-asserted-by":"crossref","unstructured":"D. E. Willard, New data structures for orthogonal range queries, SIAM J. Comput., in press.","DOI":"10.1137\/0214019"},{"key":"10.1016\/0022-0000(84)90020-5_BIB25","series-title":"Proceedings of the 17th Annual Symposium on the Foundations of Computer Science","first-page":"173","article-title":"The complexity of serarching an ordered random table","author":"Yao","year":"1976"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:27Z","timestamp":1550325087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["0022000084900205"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90020-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}