this paper. An interesting feature of compressed inverted lists is that the best compression is achieved for the longest lists, that is, the most frequent terms. In the limit---which, 7 in the case of text indexing, is a term such as "the" that occurs in almost every record---at most one bit per record is required. There is thus no particular need to eliminate common terms from the index: the decision as to whether or not to use the inverted lists for these terms to evaluate a query can be made, as it should be, at query evaluation tim
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.