论文信息 - Improved word-aligned binary compression for text indexing

Improved word-aligned binary compression for text indexing

We present an improved compression mechanism for handling the compressed inverted indexes used in text retrieval systems, extending the word-aligned binary coding carry method. Experiments using two typical document collections show that the new method obtains superior compression to previous static codes, without penalty in terms of execution speed

Alistair Moffat | Vo Ngoc Anh | V. Anh | Alistair Moffat

[1] Gonzalo Navarro,et al. (S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases , 2003, SPIRE.

[2] Ron Sacks-Davis,et al. Filtered document retrieval with frequency-sorted indexes , 1996 .

[3] Hugh E. Williams,et al. Compression of inverted indexes For fast query evaluation , 2002, SIGIR '02.

[4] Ian H. Witten,et al. Managing gigabytes (2nd ed.): compressing and indexing documents and images , 1999 .

[5] J. Shane Culpepper,et al. Enhanced Byte Codes with Restricted Prefix Properties , 2005, SPIRE.

[6] Alistair Moffat,et al. Inverted Index Compression Using Word-Aligned Binary Codes , 2004, Information Retrieval.

[7] Ian H. Witten,et al. Managing Gigabytes: Compressing and Indexing Documents and Images , 1999 .

[8] William R. Hersh,et al. Managing Gigabytes—Compressing and Indexing Documents and Images (Second Edition) , 2001, Information Retrieval.

[9] Alistair Moffat,et al. Vector-space ranking with effective early termination , 2001, SIGIR '01.

[10] Ricardo A. Baeza-Yates,et al. Fast and flexible word searching on compressed text , 2000, TOIS.

[11] Andrew Trotman,et al. Compressing Inverted Files , 2004, Information Retrieval.