Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
Author
Cambazoglu, B. B.
Aykanat, C.
Date
2006-07Source Title
Information Processing and Management
Print ISSN
0306-4573
Publisher
Elsevier Ltd
Volume
42
Issue
4
Pages
875 - 898
Language
English
Type
ArticleItem Usage Stats
49
views
views
42
downloads
downloads
Metadata
Show full item recordAbstract
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.
Keywords
ComplexityDocument ranking
Inverted index
Query processing
Scalability
Similarity calculations
Text retrieval
Computational complexity
Information analysis
Information retrieval
Information retrieval systems
Text processing