Challenges in web search engines

Monika R. Henzinger, Rajeev Motwani, Craig Silverstein
2002 SIGIR Forum  
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.
doi:10.1145/792550.792553 fatcat:wkhduzn5hncdfowx53qjz7ukxy