Sciweavers

145 search results - page 21 / 29
» On Using Query Logs for Static Index Pruning
Sort
View
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
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 10 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 1 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
ICDE
2009
IEEE
210views Database» more  ICDE 2009»
14 years 10 months ago
Keyword Search in Spatial Databases: Towards Searching by Document
This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive inf...
Dongxiang Zhang, Yeow Meng Chee, Anirban Mondal, A...
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng