Random sampling from a search engine's index

Journal of the ACM

Volumn 55, Issue 5, 2008, Pages

  Bar Yossef, Ziv ^a,b   Gurevich, Maxim ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Google Inc   (Israel)

Author keywords

Benchmarks; Sampling; Search engines; Size estimation

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; ENGINES; INFORMATION RETRIEVAL; INTERNET; RANDOM PROCESSES; SAMPLING; SEARCH ENGINES; SOFTWARE AGENTS; SYSTEMS ENGINEERING; TELECOMMUNICATION NETWORKS; WORLD WIDE WEB;

BENCHMARKS; IMPORTANCE SAMPLINGS; MAXIMUM DEGREES; MONTE CARLO SIMULATION METHODS; MSN SEARCHES; RANDOM SAMPLINGS; RANDOM WALKS; SAMPLING ALGORITHMS; SIZE ESTIMATION;

MONTE CARLO METHODS;

EID: 56349136928     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1411509.1411514     Document Type: Article

References (41)

1. ALDOUS, D. 1987. On the Markov chain simulation method for uniform combinatorial distributed and simulated annealing. Prob. Eng. Inf. Sci. 1, 33-46.
2. ANAGNOSTOPOULOS, A., BRODER, A., AND CARMEL, D. 2005. Sampling search-engine results. In Proceedings of the 14th International World Wide Web Conference (WWW). 245-256.
3. BAR-YOSSEF, Z., BERG, A., CHIEN, S., FAKCHAROENPHOL, J., AND WEITZ, D. 2000. Approximating aggregate queries about Web pages via random walks. In Proceedings of the 26th International Conference on Very Large Databases (VLDB). ACM, New York, 535-544.
4. BAR-YOSSEF, Z., AND GUREVICH, M. 2007. Efficient search engine measurements. In Proceedings of the 16th International World Wide Web Conference (WWW). 401-110.
5. BATTELLE, J. 2005. John Battelle's searchblog. http://battellemedia.com/archives/ 001889.php.
6. BHARAT, K., AND BRODER, A. 1998. A technique for measuring the relative size and overlap of public Web search engines. In Proceedings of the 7th International World Wide Web Conference (WWW7). 379-388.
7. BONDAR, S. 2006. Search engine indexing limits: Where do the bots stop? (Available at http://www.sitepoint.com/article/indexing-limits-where- bots-stop.)
8. BOYD, S., DIACONIS, P., AND XIAO, L. 2004. Fastest mixing Markov chain on a graph. SIAM Rev. 46, 4, 667-689.
9. BRADLOW, E. T., AND SCHMITTLEIN, D. C. 2000. The little engines that could: Modeling the performance of World Wide Web search engines. Market. Sci. 19, 43-62.
10. BRODER, A., FONTOURA, M., JOSIFOVSKI, V., KUMAR, R., MOTWANI, R., NABAR. S., PANIGRAHY, R., TOMKINS, A., AND XU, Y. 2006. Estimating corpus size via queries. In Proceedings of the 15th ACM International Conference on Information and Knowledge Management (Arlington, VA). ACM. New York, 594-603.
11. CAN, F., NURAY, R., AND SEVDIK, A. B. 2004. Automatic performance evaluation of Web search engines. Inf. Proc. Manage. 40, 495-514.
12. CHENEY, M., AND PERRY, M. 2005. A comparison of the size of the Yahoo! and Google indices. Available at http://vburton.ricsa. uiuc.edu/indexsize.html.
13. DAVISON, B. D. 2004. The potential of the metasearch engine. In Proceedings of the Annual Meeting of the American Society for Information Science and Technology (ASIST), Vol. 41, 393-102.
14. DIACONIS, P., AND SALOFF-COSTE, L. 1998. What do we know about the Metropolis algorithm? J. Comput. Syst. Sci. 57, 20-36.
15. DOBRA, A., AND FIENBERG, S. E. 2004. How large is the World Wide Web? Web Dyn. 23-44.
16. GILLMAN, D. 1998. A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27, 4, 1203-1220.
17. GOLUB, G. H., AND VAN LOAN, C. F. 1996. Matrix Computations, 3rd ed. The Johns Hopkins University Press, Baltimore, MD.
18. GORDON, M., AND PATHAK, P. 1999. Finding information on the World Wide Web: the retrieval effectiveness of search engines. Inf. Proc. Manage. 35, 2, 141-180.
19. GULLI, A., AND SIGNORINI, A. 2005. The indexable Web is more than 11.5 billion pages. In Proceedings of the 14th International Conference on World Wide Web (WWW) - Special Interest Tracks and Posters. 902-903.
20. HASTINGS. W. K. 1970. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 1, 97-109.
21. HAWKING, D., CRASWEL, N., BAILEY, P., AND GRIFFITHS, K. 2001. Measuring search engine quality. Inf. Retriev. 4, 1, 33-59.
22. HENZINGER, M. R., HEYDON, A., MITZENMACHER, M., AND NAIORK, M. 1999. Measuring index quality using random walks on the Web. In Proceedings of the 8th International World Wide Web Conference. 213-225.
23. HENZINGER, M. R., HEYDON, A., MITZENMACHER, M., AND NAJORK, M. 2000. On near-uniform URL sampling. In Proceedings of the 9th International World Wide Web Conference. 295-308.
24. HESTERBERG, T. C. 1988. Advances in importance sampling. Ph.D. dissertation, Stanford University.
25. KAHALE, N. 1997. Large deviation for Markov chains. Combinatorics, Probability and Computing 6, 465-174.
26. LAWRENCE, S., AND GILES, C. L. 1998. Searching the World Wide Web. Science 5360, 280, 98.
27. LAWRENCE, S., AND GILES, C. L. 1999. Accessibility of information on the Web. Nature 400, 107-109.
28. LIU, J. S. 1996. Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Stat. Comput. 6, 113-119.
29. LIU, J. S. 2001. Monte Carlo Strategies in Scientific Computing. Springer-Verlag, New York.
30. MARSHAL, A. 1956. The use of multi-stage sampling schemes in Monte Carlo computations. In Proceedings of the Symposium on Monte Carlo Methods, M. Meyer, Ed. Vol. 21, Wiley, New York, 123-140.
31. MAYER, T. 2005. Our blog is growing up - and so has our index. Available at http://www.ysearchblog.com/archives/000172.html.
32. MCCOWN, F., AND NELSON, M. L. 2007. Agreeing to disagree: Search engines and their public interfaces. In JCDL '07: Proceedings of the 2007 Conference on Digital Libraries. 309-318.
33. METROPOLIS, N., ROSENBLUTH, A., ROSENBLUTH, M., TELLER, A., AND TELLER, E. 1953. Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087-1091.
34. PRICE, G. 2005. More on the total database size battle and Googlewhacking with Yahoo. Available at http://blog.searchenginewatch.com/blog/ 050811-231448.
35. RUSMEVICHIENTONG, P., PENNOCK, D., LAWRENCE, S., AND GILES, C L. 2001. Methods for sampling pages uniformly from the World Wide Web. In Proceedings of AAAI Fall Symposium on Using Uncertainty within Computation.
36. SIEGMUND, D. 1985. Sequential Analysis - Tests and Confidence Intervals. Springer-Verlag, New York.
37. SINCLAIR, A. 1993. Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhauser Verlag, Basel, Switzerland.
38. STUART, A. and Ord, J.-K. 1994. Kendall's Advanced Theory of Statistics. Vol. 1, Distribution Theory. Haddon Arnold, London, UK.
39. SULLIVAN, D. 2005. Search engine sizes. http:// searchenginewatch.com/showPage.html? page=2156481.
40. VÉRONIS, J. 2005. Yahoo: Missing pages? (2). http://aixtal.blogspot.com/2005/08/yahoo-missing-pages-2.html.
41. VON NEUMANN, J. 1963. Various techniques used in connection with random digits. In John von Neumann, Collected Works, Vol. V. Oxford.