Inverted Index Compression Using Word-Aligned Binary Codes
- Cite this article as:
- Anh, V.N. & Moffat, A. Information Retrieval (2005) 8: 151. doi:10.1023/B:INRT.0000048490.99518.5c
- 666 Downloads
We examine index representation techniques for document-based inverted files, and present a mechanism for compressing them using word-aligned binary codes. The new approach allows extremely fast decoding of inverted lists during query processing, while providing compression rates better than other high-throughput representations. Results are given for several large text collections in support of these claims, both for compression effectiveness and query efficiency.