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:
No takes yet. Share an insight, caveat, or question.
Anagnostopoulos et al. (2005) studied this question.