Inverted Index Compression Using Word-Aligned Binary Codes

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 highthroughput representations. Results are given for several large text collections in support of these claims, both for compression effectiveness and query efficiency