%0 Conference Proceedings
%T On Placing Skips Optimally in Expectation
%A Chierichetti, Flavio
%A Lattanzi, Silvio
%A Mari, Federico
%A Panconesi, Alessandro
%E Najork, M.
%E Broder, A.Z.
%E Chakrabarti, S.
%B Web Search and Web Data Mining (WSDM 2008)
%D 2008
%I Acm
%F Chierichetti_etal2008
%O exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=94), last updated on Thu, 22 Nov 2012 14:59:18 +0100
%X We study the problem of optimal skip placement in an inverted list. Assuming the query distribution to be known in advance, we formally prove that an optimal skip placement can be computed quite efficiently. Our best algorithm runs in time O(n log n), n being the length of the list. The placement is optimal in the sense that it minimizes the expected time to process a query. Our theoretical results are matched by experiments with a real corpus, showing that substantial savings can be obtained with respect to the tra- ditional skip placement strategy, that of placing consecutive skips, each spanning sqrt(n) many locations.
%K Information Retrieval
%U http://mclab.di.uniroma1.it/publications/papers/papers/Chierichetti2008.pdf
%U http://dx.doi.org/10.1145/1341531.1341537
%P 15-24