Binary codes for non-uniform sources

Data Compression Conference Proceedings

Volumn , Issue , 2005, Pages 133-142

  Moffat, Alistair ^a   VoNgocAnh, ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DECODING; ENCODING (SYMBOLS); QUERY LANGUAGES;

DECODING PERFORMANCE; QUERIES; TEXT RETRIEVAL; WORKING SYSTEMS;

BINARY CODES;

EID: 26944480066     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. V. N. Anh and A. Moffat. Inverted index compression using word-aligned binary codes. Information Retrieval, 8(1):151-166, Jan. 2005. Source code available from www.cs.mu.oz.au/~alistair/carry/.
2. N. R. Brisaboa, A. Fariña, G. Navarro, and M. F. Esteller. (S, C)-dense coding: An optimized compression code for natural language text databases. In M. A. Nascimento, editor, Proc. Symp. String Processing and Information Retrieval, pages 122-136, Manaus, Brazil, Oct. 2003.
3. E. S. 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-139, 2000.
4. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21(2): 194-203, Mar. 1975.
5. P. Fenwick. The Burrows-Wheeler transform for block sorting text compression: Principles and improvements. The Computer Journal, 39(9):731-740, Sept. 1996.
6. A. S. Fraenkel and S. T. Klein. Novel compression of sparse bit-strings - Preliminary report. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, Volume 12, NATO ASI Series F, pages 169-183, Berlin, 1985. Springer-Verlag.
7. S. W. Golomb. Run-length encodings. IEEE Transactions on Information Theory, IT-12(3):399-401, July 1966.
8. D. A. Huffman. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Engineers, 40(9): 1098-1101, Sept. 1952.
9. A. Moffat and L. Stuiver. Binary interpolative coding for effective index compression. Information Retrieval, 3(1):25-47, July 2000.
10. A. Moffat and A. Turpin. Compression and Coding Algorithms. Kluwer Academic Publishers, Boston, MA, 2002.
11. F. Scholer, H. E. Williams, J. Yiannis, and J. Zobel. Compression of inverted indexes for fast query evaluation. In M. Beaulieu, R. Baeza-Yates, S. H. Myaeng, and K. Järvelin, editors, Proc. 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 222-229, Tampere, Finland, Aug. 2002. ACM Press, New York.
12. A. Trotman. Compressing inverted files. Information Retrieval, 6:5-19, 2003.
13. A. Turpin and A. Moffat. Housekeeping for prefix coding. IEEE Transactions on Communications, 48(4): 622-628, Apr. 2000. Source code available from www.cs.mu.oz.au/~alistair/mr_coder/.