Sampling search-engine results

Aris Anagnostopoulos, Andrei Z. Broder, David Carmel
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as:
doi:10.1145/1060745.1060784 dblp:conf/www/AnagnostopoulosBC05 fatcat:5kyhumb4uvahlmi27q7dz5q644