Exploiting Global Impact Ordering for Higher Throughput in Selective Search

This work will appear in the 41st European Conference on Information Retrieval in April 2019.

Abstract

We investigate potential benefits of exploiting a global impact ordering in a selective search architecture. We propose a generalized, ordering-aware version of the learning-to-rank-resources framework along with a modified selection strategy. By allowing partial shard processing we are able to achieve a better initial trade-off between query cost and precision than the current state of the art. Thus, our solution is suitable for increasing query throughput during periods of peak load or in low-resource systems.