Index compression method with compressed mode Boolean operators

Summary form only given. This paper describes an algorithm which provides a high degree of compression and at the same time allows logical Boolean operations to be performed directly on the compressed representation of the index. An inverted index of English text using this technique has only 20% to 25% of the size of the original text. Since logical Boolean queries can be performed on the compressed index itself, access speed is greatly enhanced