{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:02Z","timestamp":1759637642458,"version":"3.41.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Information Retrieval"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1009910017828","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T00:25:11Z","timestamp":1040603111000},"page":"7-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts"],"prefix":"10.1007","volume":"3","author":[{"given":"Shmuel T.","family":"Klein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"264567_CR1","first-page":"508","volume":"44","author":"TC Bell","year":"1993","unstructured":"Bell TC, Moffat A, Nevill-Manning CG, Witten IH and Zobel J (1993) Data compression in full-text retrieval systems. Journal ASIS, 44:508-531.","journal-title":"Journal ASIS"},{"key":"264567_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/78915.78917","volume":"8","author":"A Bookstein","year":"1990","unstructured":"Bookstein A and Klein ST (1990) Compression, information theory and grammars: A unified approach. ACM Trans. on Information Systems, 8:27-49.","journal-title":"ACM Trans. on Information Systems"},{"key":"264567_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02243872","volume":"50","author":"Bookstein","year":"1993","unstructured":"Bookstein and Klein ST (1993) Is Huffman coding dead? Computing, 50:279-296.","journal-title":"Computing"},{"key":"264567_CR4","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/0306-4573(92)90069-C","volume":"28","author":"A Bookstein","year":"1992","unstructured":"Bookstein A, Klein ST and Ziff DA (1992) A systematic approach to compressing a full text retrieval system. Information Processing & Management, 28:795-806.","journal-title":"Information Processing & Management"},{"key":"264567_CR5","doi-asserted-by":"crossref","unstructured":"Choueka Y, Klein ST and Perl Y (1985) Efficient variants of Huffman codes in high level languages. In: Proc. 8-th ACM-SIGIR Conf., Montreal, pp. 122-130.","DOI":"10.1145\/253495.342777"},{"key":"264567_CR6","doi-asserted-by":"crossref","unstructured":"de Moura ES, Navarro G, Ziviani N and Baeza-Yates R (1998) Fast searching on compressed text allowing errors. In: Proc. 21-st ACM-SIGIR Conf., Melbourne, Australia, pp. 295-306.","DOI":"10.1145\/290941.291013"},{"key":"264567_CR7","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/TIT.1984.1056931","volume":"IT-30","author":"TJ Ferguson","year":"1984","unstructured":"Ferguson TJ and Rabinowitz JH (1984) Self-synchronizing Huffman codes. IEEE Trans. on Information Theory. IT-30:687-693.","journal-title":"IEEE Trans. on Information Theory"},{"key":"264567_CR8","first-page":"149","volume":"16","author":"AS Fraenkel","year":"1976","unstructured":"Fraenkel AS (1976) All about the Responsa Retrieval Project you always wanted to know but were afraid to ask, expanded summary. Jurimetrics J., 16:149-156.","journal-title":"Jurimetrics J."},{"key":"264567_CR9","series-title":"NATO ASI Series","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-82456-2_12","volume-title":"Combinatorial Algorithms on Words","author":"AS Fraenkel","year":"1985","unstructured":"Fraenkel AS and Klein ST (1985) Novel compression of sparse bit-strings. In: Combinatorial Algorithms on Words, Springer Verlag, Berlin, pp. 169-183. NATO ASI Series, Vol. F12."},{"key":"264567_CR10","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1093\/comjnl\/33.4.296","volume":"33","author":"AS Fraenkel","year":"1990","unstructured":"Fraenkel AS and Klein ST (1990) Bidirectional Huffman coding. The Computer Journal, 33:296-307.","journal-title":"The Computer Journal"},{"key":"264567_CR11","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1093\/comjnl\/36.7.668","volume":"36","author":"AS Fraenkel","year":"1993","unstructured":"Fraenkel AS and Klein ST (1993) Bounding the depth of search trees. The Computer Journal, 36:668-678.","journal-title":"The Computer Journal"},{"key":"264567_CR12","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EN Gilbert","year":"1959","unstructured":"Gilbert EN and Moore EF (1959) Variable-length binary encodings. The Bell System Technical Journal, 38:933-968.","journal-title":"The Bell System Technical Journal"},{"key":"264567_CR13","volume-title":"Computational and Theoretical Aspects","author":"HS Heaps","year":"1978","unstructured":"Heaps HS (1978) Information Retrieval, Computational and Theoretical Aspects. Academic Press, New York."},{"key":"264567_CR14","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/77556.77566","volume":"33","author":"DS Hirschberg","year":"1990","unstructured":"Hirschberg DS and Lelewer DA (1990) Efficient decoding of prefix codes. Comm. of the ACM, 33:449-459.","journal-title":"Comm. of the ACM"},{"key":"264567_CR15","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D Huffman","year":"1952","unstructured":"Huffman D (1952) A method for the construction of minimum redundancy codes. Proc. of the IRE, 40:1098-1101.","journal-title":"Proc. of the IRE"},{"key":"264567_CR16","first-page":"284","volume":"IT-11","author":"GHO Katona","year":"1965","unstructured":"Katona GHO and Nemetz TOH (1965) Huffman codes and self-information. IEEE Trans. on Inf. Th., IT-11:284-292.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"264567_CR17","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/65943.65946","volume":"7","author":"ST Klein","year":"1989","unstructured":"Klein ST, Bookstein A and Deerwester S (1989) Storing text retrieval systems on CD-ROM: Compression and encryption considerations. ACM Trans. on Information Systems, 7:230-245.","journal-title":"ACM Trans. on Information Systems"},{"key":"264567_CR18","volume-title":"Vol. I: Fundamental Algorithms","author":"DE Knuth","year":"1973","unstructured":"Knuth DE (1973) The Art of Computer Programming, Vol. I: Fundamental Algorithms. Addison-Wesley, Reading, MA."},{"key":"264567_CR19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/45072.45074","volume":"19","author":"DA Lelewer","year":"1987","unstructured":"Lelewer DA and Hirschberg DS (1987) Data compression. ACM Computing Surveys, 19:261-296.","journal-title":"ACM Computing Surveys"},{"key":"264567_CR20","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/TIT.1982.1056452","volume":"IT-28","author":"G Longo","year":"1982","unstructured":"Longo G and Galasso G (1982) An application of informational divergence to Huffman codes. IEEE Trans. on Inf. Th., IT-28:36-43.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"264567_CR21","first-page":"537","volume":"46","author":"A Moffat","year":"1995","unstructured":"Moffat A and Bell T (1995) In-situ generation of compressed inverted files. J. ASIS, 46:537-550.","journal-title":"J. ASIS"},{"key":"264567_CR22","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/26.634683","volume":"45","author":"A Moffat","year":"1997","unstructured":"Moffat A and Turpin A (1997) On the implementation of minimum redundancy prefix codes. IEEE Trans. on Communications, 45:1200-1207.","journal-title":"IEEE Trans. on Communications"},{"key":"264567_CR23","doi-asserted-by":"crossref","unstructured":"Moffat A, Turpin A and Katajainen J (1995) Space-efficient construction of optimal prefix codes. In: Proc. Data Compression Conference DCC-95, Snowbird, Utah, pp. 192-201.","DOI":"10.1109\/DCC.1995.515509"},{"key":"264567_CR24","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/69.591454","volume":"9","author":"A Moffat","year":"1997","unstructured":"Moffat A, Zobel J and Sharman N (1997) Text compression for dynamic document databases. IEEE Transactions on Knowledge and Data Engineering, 9:302-313.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"264567_CR25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/363958.363991","volume":"7","author":"ES Schwartz","year":"1964","unstructured":"Schwartz ES and Kallick B (1964) Generating a canonical prefix encoding. Comm. of the ACM, 7:166-169.","journal-title":"Comm. of the ACM"},{"key":"264567_CR26","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(88)90146-9","volume":"26","author":"A Sieminski","year":"1988","unstructured":"Sieminski A (1988) Fast decoding of the Huffman codes. Information Processing Letters, 26:237-241.","journal-title":"Information Processing Letters"},{"key":"264567_CR27","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"IH Witten","year":"1994","unstructured":"Witten IH, Moffat A and Bell TC (1994) Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York."},{"key":"264567_CR28","volume-title":"The Psycho-Biology of Language","author":"GK Zipf","year":"1935","unstructured":"Zipf GK (1935) The Psycho-Biology of Language. Boston, Houghton."},{"key":"264567_CR29","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J Ziv","year":"1977","unstructured":"Ziv J and Lempel A (1977) A universal algorithm for sequential data compression. IEEE Trans. on Inf. Th., IT-23:337-343.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"264567_CR30","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT-24","author":"J Ziv","year":"1978","unstructured":"Ziv J and Lempel A (1978) Compression of individual sequences via variable-rate coding. IEEE Trans. on Inf. Th., IT-24:530-536.","journal-title":"IEEE Trans. on Inf. Th."},{"key":"264567_CR31","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1002\/spe.4380250804","volume":"26","author":"J Zobel","year":"1995","unstructured":"Zobel J and Moffat A(1995) Adding compression to a full-text retrieval system. Software-Practice & Experience, 26:891-903.","journal-title":"Software-Practice & Experience"}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009910017828.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009910017828\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009910017828.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T12:21:29Z","timestamp":1748348489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009910017828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["264567"],"URL":"https:\/\/doi.org\/10.1023\/a:1009910017828","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"type":"print","value":"1386-4564"},{"type":"electronic","value":"1573-7659"}],"subject":[],"published":{"date-parts":[[2000,7]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}