Sciweavers

12 search results - page 1 / 3
» Best bets: thousands of queries in search of a client
Sort
View
WWW
2004
ACM
14 years 5 months ago
Best bets: thousands of queries in search of a client
A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to ...
Giuseppe Attardi, Andrea Esuli, Maria Simi
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 4 months 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
SDMW
2004
Springer
13 years 9 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker
WWW
2005
ACM
14 years 5 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
CN
2000
107views more  CN 2000»
13 years 4 months ago
Query routing for Web search engines: architecture and experiments
General-purpose search engines such as AltaVista and Lycos are notorious for returning irrelevant results in response to user queries. Consequently, thousands of specialized, topi...
Atsushi Sugiura, Oren Etzioni