Fast Ranking in Limited Space (1994)
| Venue: | Proc. IEEE Conf. on Data Engineering |
| Citations: | 18 - 3 self |
BibTeX
@INPROCEEDINGS{Moffat94fastranking,
author = {Alistair Moffat and Justin Zobel},
title = {Fast Ranking in Limited Space},
booktitle = {Proc. IEEE Conf. on Data Engineering},
year = {1994},
pages = {428--437}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Ranking techniques have long been suggested as alternatives to more conventional Boolean methods for searching document collections. The cost of computing a ranking is, however, greater than the cost of performing a Boolean search, in terms of both memory space and processing time. Here we consider the resources required by the cosine method of ranking, and show that with a careful application of indexing and selection techniques both the space and time required by ranking can be substantially reduced. The methods described in this paper have been used to build a retrieval system for a collection of over two million pages of text, with which it is possible to process ranked queries of 50--60 terms in about 5% of the space required by previous implementations; in as little as 25% of the time; and with no loss of retrieval effectiveness. 1 Introduction Ranking techniques are used to find the documents in a document collection that are most likely to be relevant to an informally-phrased ...
