Score-Safe Term Dependency Processing
With Hybrid Indexes
Matthias Petri
School of Computer Science and Information Technology,
RMIT University,
Victoria 3001, Australia
and
Department of Computing and Information Systems,
The University of Melbourne,
Victoria 3010, Australia.
Alistair Moffat
Department of Computing and Information Systems,
The University of Melbourne,
Victoria 3010, Australia.
J. Shane Culpepper
School of Computer Science and Information Technology,
RMIT University,
Victoria 3001, Australia.
Status
Proc. 37th Annual International ACM SIGIR Conference on
Research and Development in Information Retrieval,
Gold Coast, July 2014, pages 899-902.
Abstract
Score-safe index processing has received a great deal of attention
over the last two decades.
By pre-calculating maximum term impacts during indexing, the number
of scoring operations can be minimized, and the top-k documents for a
query can be located efficiently.
However, these methods often ignore the importance of the
effectiveness gains possible when using sequential dependency models.
We present a hybrid approach which leverages score-safe processing
and suffix-based self-indexing structures in order to provide
efficient and effective top-k document retrieval.
Full text
http://dx.doi.org/10.1145/2600428.2609469