Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: Performance of query processing implementations
in ranking-based text retrieval systems using inverted indices
B. Barla Cambazoglu, Cevdet Aykanat *
Computer Engineering Department, Bilkent University, TR 06800 Bilkent, Ankara, Turkey
Received 22 May 2005; accepted 16 June 2005
Available online 10 August 2005
Abstract
Similarity calculations and document ranking form the computationally expensive parts of query processing in rank-
ing-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 car-
ried 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.
2005 Elsevier Ltd. All rights reserved.
Keywords: Text retrieval; Query processing; Inverted index; Similarity calculations; Document ranking; Complexity; Scalability
1. Introduction
In the last decade, a shift has been observed from the Boolean model of query processing to the more
effective ranking-based model. In text retrieval systems employing the ranking-based model, similarity cal-

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences