{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:59Z","timestamp":1725663719267},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573012"},{"type":"electronic","value":"9783540480471"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57301-1_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:42:32Z","timestamp":1330260152000},"page":"130-145","source":"Crossref","is-referenced-by-count":4,"title":["Trie methods for representing text"],"prefix":"10.1007","author":[{"given":"T. H.","family":"Merrett","sequence":"first","affiliation":[]},{"given":"Heping","family":"Shang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"9_CR1","volume-title":"Compilers Principles, Techniques, and Tools","author":"A. V. Aho","year":"1986","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers Principles, Techniques, and Tools. Addison-Wesley Publishing Co., Reading, MA, 1986."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"R. de la Briandais. File searching using variable-length keys. In Proc. Western Joint Computer Conf., pages 295\u20138, San Francisco, March 1959.","DOI":"10.1145\/1457838.1457895"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02279819","volume":"28","author":"L. Devroye","year":"1982","unstructured":"L. Devroye. A note on the average depth of tries. Computing, 28:367\u2013371, 1982.","journal-title":"Computing"},{"issue":"9","key":"9_CR4","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. H. Fredkin","year":"1960","unstructured":"E. H. Fredkin. Trie memory. Communications of the ACM, 3(9):490\u20139, Sept. 1960.","journal-title":"Communications of the ACM"},{"key":"9_CR5","volume-title":"Technical Report OED-88-02","author":"G. H. Gonnet","year":"1988","unstructured":"G. H. Gonnet. Efficient searching of text and pictures. Technical Report OED-88-02, Centre for the New Oxford English Dictionary, University of Waterloo, Waterloo, Ont., Canada, 1988."},{"key":"9_CR6","volume-title":"Technical Report OED-91-01","author":"G. H. Gonnet","year":"1991","unstructured":"G. H. Gonnet, R. A. Baeza-Yates, and T. Snider. Lexicograhic indices for text: Inverted files vs. PAT trees. Technical Report OED-91-01, Centre for the New Oxford English Dictionary, University of Waterloo, Waterloo, Ont., Canada, February 1991."},{"key":"9_CR7","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1968\u20131973","unstructured":"D. E. Knuth. The Art of Computer Programming. Addison-Wesley Publishing Co., Reading, Mass., 1968\u20131973. Volumes I, II, III."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"T. H. Merrett and H. Shang. Trie methods for representing text. Technical Report TR-SOCS-93.3, McGill University, School of Computer Science, June 1993.","DOI":"10.1007\/3-540-57301-1_9"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D. R. Morrison","year":"1968","unstructured":"D. R. Morrison. PATRICIA: Practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM, 15:514\u201334, 1968.","journal-title":"Journal of the ACM"},{"key":"9_CR10","unstructured":"J. A. Orenstein. Blocking mechanism used by multidimensional tries. Unpublished Letter, February 1983."},{"issue":"2","key":"9_CR11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1214\/aop\/1176993000","volume":"13","author":"B. Pittel","year":"1985","unstructured":"B. Pittel. Asymptotical growth of a class of random trees. The Annals of Probability, 13(2):414\u2013427, 1985.","journal-title":"The Annals of Probability"}],"container-title":["Lecture Notes in Computer Science","Foundations of Data Organization and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57301-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:06Z","timestamp":1605647466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57301-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573012","9783540480471"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57301-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}