Performance of query processing implementations in ranking-based text retrieval systems using inverted indices

Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11 alternative implementation techniques are presented under four different categories, and their asymptotic time and space complexities are investigated. To our knowledge, six of these techniques are not discussed in any other publication before. Furthermore, analytical experiments are carried out on a 30 GB document collection to evaluate the practical performance of different implementations in terms of query processing time and space consumption. Advantages and disadvantages of each technique are illustrated under different querying scenarios, and several experiments that investigate the scalability of the implementations are presented.

• Type: Journal
• Year: 2006
• Where: IPM
• Authors: Berkant Barla Cambazoglu, Cevdet Aykanat
• Keywords: Computationally Expensive, IPM 2006, Ranking-based Text Retrieval, Similarity Calculations