Probabilistic Scheduling for Top-k Index Processing
Search engines are known to everyone. Google, Yahoo! Search, MSN
Search. Researchers work very hard to make them give better quality
results. My thesis is not to make them more accurate but to make
them faster. I will present the Top-k threshold algorithm that works
on inverted index lists and show how we try to speed it up.