In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web.
No takes yet. Share an insight, caveat, or question.
Monika Henzinger (2004) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: