Sreenivas Gollapudi
Stelios Paparizos
ABSTRACT
Web search engines incorporate results from structured data sources to answer semantically rich user queries, i.e. Samsung 50 inch led tv can be answered from a table of television data. However, users are not domain experts and quite often enter values that do not match precisely the underlying data, so a literal execution will return zero results. A search engine would prefer to return at least a minimum number of results as close to the original query as possible while providing a time-bound execution guarantee. In this paper, we formalize these requirements, show the problem is NP-Hard and present approximation algorithms that produce rewrites that work in practice. We empirically validate our algorithms on large-scale data from a major search engine.
- Msn shopping xml api: Specs. http://shopping.msn.com/xml/v1/getspecs.aspx?itemid=1202956773.Google Scholar
- Msn shopping xml api: Televisions. http://shopping.msn.com/xml/v1/getresults.aspx?bcatid=4724.Google Scholar
- M. Bergman. The deep web: Surfacing hidden value. Journal of Electronic Publishing, 7(1), 2001.Google ScholarCross Ref
- M. J. Cafarella, A. Y. Halevy, D. Z. Wang, E. W. 0002, and Y. Zhang. Webtables: exploring the power of tables on the web. PVLDB, 1(1):538--549, 2008. Google ScholarDigital Library
- M. Fontoura, V. Josifovski, R. Kumar, C. Olston, A. Tomkins, and S. Vassilvitskii. Relaxation in text search using taxonomies. PVLDB, 1(1):672--683, 2008. Google ScholarDigital Library
- N. Koudas, C. Li, A. K. H. Tung, and R. Vernica. Relaxing join and selection queries. In VLDB, 2006. Google ScholarDigital Library
- D. Panigrahi and S. Gollapudi. Result enrichment in commerce search using browse trails. In WSDM, 2011. Google ScholarDigital Library
- N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proc. SIGMOD Conf., June 1995. Google ScholarDigital Library
- N. Sarkas, S. Paparizos, and P. Tsaparas. Structured annotations of web queries. In SIGMOD Conf., 2010. Google ScholarDigital Library
Index Terms
- Efficient query rewrite for structured web queries
Recommendations
Evaluating leading web search engines on children's queries
HCII'11: Proceedings of the 14th international conference on Human-computer interaction: users and applications - Volume Part IVThis study compared retrieved results, relevance ranking, and overlap across Google, Yahoo!, Bing, Yahoo Kids!, and Ask Kids on 15 queries constructed by middle school children. Queries included one word, two words, and multiple words/phrases/natural ...
Learning from homologous queries and semantically related terms for query auto completion
We propose a learning to rank based query auto completion model (L2R-QAC) that exploits contributions from so-called homologous queries for a QAC candidate, in which two kinds of homologous queries are taken into account.We propose semantic features for ...
Efficient query processing in geographic web search engines
SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of dataGeographic web search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search technology, also called local search, has recently received significant ...
Comments