Sciweavers

621 search results - page 16 / 125
» Learning to Distribute Queries into Web Search Nodes
Sort
View
WWW
2005
ACM
16 years 1 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
SIGMOD
1997
ACM
125views Database» more  SIGMOD 1997»
15 years 4 months ago
The Distributed Information Search Component (Disco) and the World Wide Web
The Distributed Information Search COmponent (Disco) is a prototype heterogeneous distributed database that accesses underlying data sources. The Disco prototype currently focuses...
Anthony Tomasic, Rémy Amouroux, Philippe Bo...
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
16 years 24 days ago
Identifying "best bet" web search results by mining past user behavior
The top web search result is crucial for user satisfaction with the web search experience. We argue that the importance of the relevance at the top position necessitates special h...
Eugene Agichtein, Zijian Zheng
WWW
2008
ACM
16 years 1 months ago
Deciphering mobile search patterns: a study of Yahoo! mobile search queries
In this paper we study the characteristics of search queries submitted from mobile devices using various Yahoo! oneSearch applications during a 2 months period in the second half ...
Jeonghee Yi, Farzin Maghoul, Jan O. Pedersen
94
Voted
WWW
2009
ACM
16 years 1 months ago
Towards context-aware search by learning a very large variable length hidden markov model from search logs
Capturing the context of a user's query from the previous queries and clicks in the same session may help understand the user's information need. A context-aware approac...
Huanhuan Cao, Daxin Jiang, Jian Pei, Enhong Chen, ...