Efficient passage ranking for document databases

Marcin Kaszkiel

doi:10.1145/326440.326445

Efficient passage ranking for document databases

1999-10-01

42

OA

AI

DOI：10.1145/326440.326445

原文链接

查看原文

摘要

En 中文

Queries to text collections are resolved by ranking the documents in the collection and returning the highest-scoring documents to the user. An alternative retrieval method is to rank passages, that is, short fragments of documents, a strategy that can improve effectiveness and identify relevant material in documents that are too large for users to consider as a whole. However, ranking of passages can considerably increase retrieval costs. In this article we explore alternative query evaluation techniques, and develop new techniques for evaluating queries on passages. We show experimentally that, appropriately implemented, effective passage retrieval is practical in limited memory on a desktop machine. Compared to passage ranking with adaptations of current document ranking algorithms, our new DO-TOS passage-ranking algorithm requires only a fraction of the resources, at the cost of a small loss of effectiveness.

Keyword:

algorithms

performance

inverted files

passage retrieval

query evaluation

text databases

text retrieval

Efficient passage ranking for document databases

摘要

AI总结

期刊

机构

引用论文