{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:22:11Z","timestamp":1771701731666,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540012740","type":"print"},{"value":"9783540366188","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36618-0_33","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:49:02Z","timestamp":1184600942000},"page":"468-481","source":"Crossref","is-referenced-by-count":30,"title":["An Efficient Compression Code for Text Databases"],"prefix":"10.1007","author":[{"given":"Nieves R.","family":"Brisaboa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva L.","family":"Iglesias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Param\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"M. D. Ara\u00fajo, G. Navarro, and N. Ziviani. Large text searching allowing errors. In R. Baeza-Yates, editor, Proc. 4th South American Workshop on String Processing (WSP\u201997), pages 2\u201320. Carleton University Press, 1997.","DOI":"10.1515\/9780773591400-003"},{"key":"33_CR2","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999."},{"key":"33_CR3","unstructured":"T. C. Bell, J. G. Cleary, and I. H. Witten. Text Compression. Prentice Hall, 1990."},{"issue":"9","key":"33_CR4","first-page":"1098","volume":"40","author":"D. A. Huffman","year":"1952","unstructured":"D. A. Huffman. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng., 40(9):1098\u20131101, September 1952.","journal-title":"Proc. Inst. Radio Eng."},{"key":"33_CR5","unstructured":"B. Mandelbrot. An informational theory of the statistical structure of language. In Proc. Symp. on Applications of Communication Theory, pages 486\u2013500, 1952."},{"issue":"1","key":"33_CR6","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/18.108260","volume":"38","author":"D. Manstetten","year":"1992","unstructured":"D. Manstetten. Tight bounds on the redundancy of Huffman codes. IEEE Trans. on Information Theory, 38(1):144\u2013151, January 1992.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/spe.4380190207","volume":"19","author":"A. Moffat","year":"1989","unstructured":"A. Moffat. Word-based text compression. Software \u2014 Practice and Experience, 19(2): 185\u2013198, 1989.","journal-title":"Software \u2014 Practice and Experience"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"A. Moffat and A. Turpin. On the implementation of minimum-redundancy prefix codes. In Proc. Data Compression Conference, pages 170\u2013179, 1996.","DOI":"10.1109\/DCC.1996.488322"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1009934302807","volume":"3","author":"G. Navarro","year":"2000","unstructured":"G. Navarro, E. Silva de Moura, M. Neubert, N. Ziviani, and R. Baeza-Yates. Adding compression to block addressing inverted indexes. Information Retrieval, 3(1):49\u201377, 2000.","journal-title":"Information Retrieval"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings \u2014 Practical online search algorithms for texts and biological sequences. Cambridge University Press, 2002.","DOI":"10.1017\/CBO9781316135228"},{"key":"33_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45123-4_16","volume-title":"Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM\u20192000)","author":"G. Navarro","year":"2000","unstructured":"G. Navarro and J. Tarhio. Boyer-moore string matching over ziv-lempel compressed text. In Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM\u20192000), LNCS 1848, pages 166\u2013180, 2000."},{"issue":"1","key":"33_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1008273408148","volume":"15","author":"R. Prisco De","year":"1998","unstructured":"R. De Prisco and A. De Santis. On lower bounds for the redundancy of optimal codes. Designs, Codes and Cryptography, 15(1):29\u201345, 1998.","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"33_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. Silva de Moura","year":"2000","unstructured":"E. Silva de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Transactions on Information Systems, 18(2):113\u2013139, April 2000.","journal-title":"ACM Transactions on Information Systems"},{"key":"33_CR14","unstructured":"I. Witten, A. Moffat, and T. Bell. Managing Gigabytes. Morgan Kaufmann Publishers, second edition, 1999."},{"key":"33_CR15","unstructured":"G. Zipf. Human Behaviour and the Principle of Least Effort. Addison-Wesley, 1949."},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337\u2013343, 1977.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"33_CR17","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5):530\u2013536, 1978.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"33_CR18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/2.881693","volume":"33","author":"N. Ziviani","year":"2000","unstructured":"N. Ziviani, E. Silva de Moura, G. Navarro, and R. Baeza-Yates. Compression: A key for next-generation text retrieval systems. IEEE Computer, 33(11):37\u201344, 2000.","journal-title":"IEEE Computer"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36618-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T18:34:38Z","timestamp":1708108478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36618-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540012740","9783540366188"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-36618-0_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}