Sorting out the document identifier assignment problem

Silvestri F.

H.3 Information Storage and Retrieval  H.3.1 Content Analysis and Indexing. Indexing Methods  Indexing technique  Identifier assignment  Information retrieval index compression 

The compression of Inverted File indexes in Web Search Engines has received a lot of attention in these last years. Compressing the index not only reduces space occupancy but also improves the overall retrieval performance since it allows a better exploitation of the memory hierarchy. In this paper we are going to empirically show that in the case of collections of Web Documents we can enhance the performance of compression algorithms by simply assigning identifiers to documents according to the lexicographical ordering of the URLs. We will validate this assumption by comparing several assignment techniques and several compression algorithms on a quite large document collection composed by about six million documents. The results are very encouraging since we can improve the compression ratio up to 40% using an algorithm that takes about ninety seconds to finish using only 100 MB of main memory.

Source: Lecture notes in computer science 4425 (2007): 101–112. doi:10.1007/978-3-540-71496-5_12

Publisher: Springer, Berlin , Germania

Metrics