Mining Search Engine Query Logs via Suggestion Sampling
Summary: Black-box Monte Carlo algorithms sample hidden auto-completion databases through public suggestion APIs, either uniformly or popularity-proportionally. Enables unbiased mining of query logs—keyword popularity, commercial-query prevalence, and negative-content exposure—without direct database access. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ziv Bar-Yossef (Google; Technion)
- 2. Maxim Gurevich (Technion)
BibTeX Citation
@article{baryossef_vldb08,
title = {{Mining Search Engine Query Logs via Suggestion Sampling}},
author = {Bar-Yossef, Ziv and Gurevich, Maxim},
journal = {PVLDB},
series = {{VLDB} '08},
pages = {54},
doi = {10.14778/1453856.1453868},
url = {https://doi.org/10.14778/1453856.1453868},
year = {2008}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,393 | Measure-driven Keyword-Query Expansion | 2009 | VLDB | 6.6087082e-05 |
| 8,086 | Mining a Search Engine’s Corpus: Efficient Yet Unbiased Sampling and Aggregate Estimation | 2011 | SIGMOD | 5.3748177e-05 |
| 8,413 | Query Expansion Based on Clustered Results | 2011 | VLDB | 5.3210066e-05 |
| 8,861 | Unbiased Estimation of Size and Other Aggregates Over Hidden Web Databases | 2010 | SIGMOD | 5.2477452e-05 |
| 9,898 | Optimal Algorithms for Crawling a Hidden Database in the Web | 2012 | VLDB | 5.0992325e-05 |
| 9,899 | Attribute Domain Discovery for Hidden Web Databases | 2011 | SIGMOD | 5.0992325e-05 |
| 12,625 | Rank Discovery From Web Databases | 2013 | VLDB | 4.9605343e-05 |
| 12,724 | Randomized Generalization for Aggregate Suppression Over Hidden Web Databases | 2011 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 480 | Random Sampling from B+ trees | 1989 | VLDB | 0.00017573936 |
| 2,722 | Comparing and Aggregating Rankings with Ties | 2004 | PODS | 8.0756994e-05 |
| 5,996 | A Random Walk Approach to Sampling Hidden Databases | 2007 | SIGMOD | 5.9037651e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,964 | Exemplar Queries: Give me an Example of What You Need | 2014 | VLDB |
| 2 | 7,014 | Facet Discovery for Structured Web Search: A Query-log Mining Approach | 2011 | SIGMOD |
| 3 | 9,898 | Optimal Algorithms for Crawling a Hidden Database in the Web | 2012 | VLDB |
| 4 | 12,724 | Randomized Generalization for Aggregate Suppression Over Hidden Web Databases | 2011 | VLDB |
| 5 | 8,480 | Experiments on Query Expansion for Internet Yellow Page Services Using Web Log Mining | 2002 | VLDB |
| 6 | 1,519 | Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection | 2002 | VLDB |
| 7 | 5,996 | A Random Walk Approach to Sampling Hidden Databases | 2007 | SIGMOD |
| 8 | 8,861 | Unbiased Estimation of Size and Other Aggregates Over Hidden Web Databases | 2010 | SIGMOD |
| 9 | 12,649 | Aggregate Suppression for Enterprise Search Engines | 2012 | SIGMOD |
| 10 | 8,086 | Mining a Search Engine’s Corpus: Efficient Yet Unbiased Sampling and Aggregate Estimation | 2011 | SIGMOD |