Exploiting clustering in inverted file compression

Abstract

This work further extends the notion of context-based index compression. In particular, a surprisingly simple index representation is presented. This representation gives excellent performance on all of the test databases, allows fast decoding, and is, even in the worst case, only slightly inferior to Golomb coding.