Mining search engine query logs via suggestion sampling

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 54-65

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; MONTE CARLO METHODS; QUERY PROCESSING; SEARCH ENGINES;

AUTO COMPLETION; EMPIRICAL ANALYSIS; QUERY LOGS; USER TYPE; WEB APPLICATION;

INFORMATION RETRIEVAL;

EID: 74549198813     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453868     Document Type: Article

References (25)

1. R. Baeza-Yates, A. Gionis, F. Junqueira, V. Murdock, V. Plachouras, and F. Silvestri. The impact of caching on search engines. In Proc. 30th SIGIR, pages 183-190, 2007.
2. R. Baeza-Yates and F. Saint-Jean. A three level search engine index based in query log distribution. In SPIRE, pages 56-65, 2003.
3. Z. Bar-Yossef and M. Gurevich. Random sampling from a search engine's index. In Proc. 15th WWW, pages 367-376, 2006.
4. Z. Bar-Yossef and M. Gurevich. Efficient search engine measurements. In Proc. 16th WWW, pages 401-410, 2007.
5. K. Bharat and A. Broder. A technique for measuring the relative size and overlap of public Web search engines. In Proc. 7th WWW, pages 379-388, 1998.
6. A. Broder, M. Fontoura, V. Josifovski, R. Kumar, R. Motwani, S. Nabar, R. Panigrahy, A. Tomkins, and Y. Xu. Estimating corpus size via queries. In Proc. 15th CIKM, pages 594-603, 2006.
7. M. Cheney and M. Perry. A comparison of the size of the Yahoo! and Google indices. Available at http://vburton.ncsa.uiuc.edu/indexsize.html, 2005.
8. A. Clauset, C. R. Shalizi, and M. E. J. Newman. Power-law distributions in empirical data, 2007.
9. A. Dasgupta, G. Das, and H. Mannila. A random walk approach to sampling hidden databases. In Proc. SIGMOD, pages 629-640, 2007.
10. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and aggregating rankings with ties. In Proc. 23rd PODS, pages 47-58, 2004.
11. A. Gulli and A. Signorini. The indexable Web is more than 11.5 billion pages. In Proc. 14th WWW, pages 902-903, 2005.
12. T. C. Hesterberg. Advances in Importance Sampling. PhD thesis, Stanford University, 1988.
13. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci., 43(2-3):169-188, 1986.
14. T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In Proc. 28th SIGIR, pages 154-161, 2005.
15. D. E. Knuth. Estimating the efficiency of backtrack programs. Mathematics of Computation, 29(129):121-136, 1975.
16. S. Lawrence and C. L. Giles. Searching the World Wide Web. Science, 5360(280):98, 1998.
17. J. S. Liu. Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Statistics and Computing, 6:113-119, 1996.
18. J. S. Liu. Monte Carlo Strategies in Scientific Computing. Springer, 2001.
19. A. W. Marshal. The use of multi-stage sampling schemes in Monte Carlo computations. In Symposium on Monte Carlo Methods, pages 123-140, 1956.
20. F. Olken and D. Rotem. Random sampling from B+ trees. In Proc. 15th VLDB, pages 269-277, 1989.
21. F. Olken and D. Rotem. Random sampling from databases - a survey. Statistics & Computing, 5(1):25-42, 1995.
22. G. Pass, A. Chowdhury, and C. Torgeson. A picture of search. In Proc. 1st InfoScale, 2006.
23. P. C. Saraiva, E. S. de Moura, R. C. Fonseca, Wagner Meira. Jr., B. A. Ribeiro-Neto, and N. Ziviani. Rank-preserving two-level caching for scalable search engines. In Proc. 24th SIGIR, pages 51-58, 2001.
24. C. K. Wong and M. C. Easton. An efficient method for weighted sampling without replacement. SIAM J. on Computing, 9(1):111-113, 1980.
25. Y. Xie and D. R. O'Hallaron. Locality in search engine queries and its implications for caching. In Proc. 21st INFOCOM, 2002.