Sciweavers

3652 search results - page 234 / 731
» A study of query length
Sort
View
WWW
2006
ACM
14 years 9 months ago
Efficient query subscription processing for prospective search engines
Current web search engines are retrospective in that they limit users to searches against already existing pages. Prospective search engines, on the other hand, allow users to upl...
Utku Irmak, Svilen Mihaylov, Torsten Suel, Samrat ...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 8 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
POPL
2007
ACM
14 years 8 months ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook
SIGMOD
2009
ACM
133views Database» more  SIGMOD 2009»
14 years 8 months ago
Hierarchical result views for keyword queries over relational databases
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
Shiyuan Wang, Jun'ichi Tatemura, Arsany Sawires, O...
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
14 years 8 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...