Answers are grounded in this paper and cite their sources.
Summary We introduce and test several micro‐ and macro‐optimizations to the Score‐at‐a‐Time approach to processing impact‐ordered postings lists in a search engine. Our micro‐optimizations are at the single‐assembly instruction level, but our macro‐optimizations are algorithmic. Overall, we see an improvement of 37% on our baseline (22% on state of the art). We experiment with parallel search and present evidence that we have hit the memory wall.
No takes yet. Share an insight, caveat, or question.
Trotman et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: