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

Date
2006-07
Advisor
Instructor
Source Title
Information Processing and Management
Print ISSN
0306-4573
Electronic ISSN
Publisher
Elsevier Ltd
Volume
42
Issue
4
Pages
875 - 898
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Abstract

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. © 2005 Elsevier Ltd. All rights reserved.

Course
Other identifiers
Book Title
Keywords
Complexity, Document ranking, Inverted index, Query processing, Scalability, Similarity calculations, Text retrieval, Computational complexity, Information analysis, Information retrieval, Information retrieval systems, Text processing
Citation
Published Version (Please cite this version)