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. © 2005 Springer Science + Business Media, Inc.
CITATION STYLE
Anh, V. N., & Moffat, A. (2005). Inverted index compression using word-aligned binary codes. Information Retrieval, 8(1), 151–166. https://doi.org/10.1023/B:INRT.0000048490.99518.5c
Mendeley helps you to discover research relevant for your work.