Reorganizing compressed text

ACM SIGIR 2008 - 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Proceedings

Volumn , Issue , 2008, Pages 139-146

  Brisaboa, Nieves R ^a   Fariña, Antonio ^a   Ladra, Susana ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Compressed indexing; Searching compressed text; Word based compression

Indexed keywords

INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; INFORMATION SERVICES; LEARNING ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS; PROGRAMMING THEORY; RESEARCH AND DEVELOPMENT MANAGEMENT; TERMINOLOGY;

ARBITRARY POINTS; BYTE CODES; CLASSICAL COUNTERPARTS; CODING METHODS; COMPRESSED INDEXING; COMPRESSION METHODS; COMPRESSION RATES; COMPRESSION TECHNIQUES; DECOMPRESSION TIMES; DENSE CODES; DIRECT SEARCHES; FAST SEARCHES; HUFFMAN; INVERTED LISTS; NATURAL LANGUAGE TEXTS; RANDOM ACCESSES; RANDOM POSITIONS; SEARCH TIMES; SEARCHING CAPABILITIES; SEARCHING COMPRESSED TEXT; SEQUENTIAL SEARCHES; SYNCHRONIZATION PROPERTIES; TEXT LENGTHS; TEXT SEARCHES; WORD-BASED COMPRESSION;

CODES (SYMBOLS);

EID: 57349197117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390334.1390360     Document Type: Conference Paper

References (19)

1. R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.
2. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762-772, 1977.
3. N. Brisaboa, A. Fariña, G. Navarro, and J. Parama. Lightweight natural language text compression. Information Retrieval, 10(1):1-33, 2007.
4. J. S. Culpepper and A. Moffat. Enhanced byte codes with restricted prefix properties. In Proc. 12th SPIRE'05, LNCS 3772, pages 1-12, 2005.
5. J. S. Culpepper and A. Moffat. Compact set representation for information retrieval. In Proc. 14th SPIRE'07, LNCS 4726, pages 137-148, 2007.
6. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms, 3(2):art.20, 2007.
7. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th SODA '03, pages 841-850, 2003.
8. D. A. Huffman. A method for the construction of minimum-redundancy codes. In Proc. Inst. Radio Eng., volume 40, pages 1098-1101, 1952.
9. A. Moffat. Word-based text compression. Software Practice & Experience, 19(2): 185-198, 1989.
10. E. Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast searching on compressed text allowing errors. In Proc. 21th SIGIR'98, pages 298-306, 1998.
11. E. 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.
12. I. Munro. Tables. In Proc. 16th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1180, pages 37-42, 1996.
13. G. Navarro and V. Mäkinen. Compressed full-text indexes. ACM Computing Surveys, 39(1):art.2, 2007.
14. G. Navarro, E. Moura, M. Neubert, N. Ziviani, and R. Baeza-Yates. Adding compression to block addressing inverted indexes. Information Retrieval, 3(1):49-77, 2000.
15. P. Sanders and F. Transier. Intersection in integer inverted indices. In Proc. 9th ALENEX'07, 2007.
16. T. Strohman and B. Croft. Efficient document retrieval in main memory. In Proc. 30th SIGIR '07, pages 175-182. ACM Press, 2007.
17. A. Turpin and A. Moffat. Fast file search using text compression. In Proc. 20th Australasian Computer Science Conference, pages 1-8, 1997.
18. G. K. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.
19. J. Zobel, A. Moffat, and K. Ramamohanarao. Inverted files versus signature files for text indexing. ACM Transactions on Database Systems, 23(4):453-490, 1998.