Sciweavers

2067 search results - page 217 / 414
» Modeling and exploiting query interactions in database syste...
Sort
View
SIGIR
2010
ACM
15 years 10 months ago
Ready to buy or just browsing?: detecting web searcher goals from interaction data
An improved understanding of the relationship between search intent, result quality, and searcher behavior is crucial for improving the effectiveness of web search. While recent p...
Qi Guo, Eugene Agichtein
EDBT
2006
ACM
143views Database» more  EDBT 2006»
16 years 6 months ago
XG: A Grid-Enabled Query Processing Engine
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Thom...
CHI
2009
ACM
16 years 6 months ago
Predicting query reformulation during web searching
This paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
SG
2009
Springer
16 years 24 days ago
Interactive Context-Aware Visualization for Mobile Devices
Abstract. Utilizing context information—e.g. location, user aspects, or hardware capabilities—enables the presented generic framework to automatically control the selection and...
Mike Eissele, Daniel Weiskopf, Thomas Ertl
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang