Sciweavers

22 search results - page 2 / 5
» A Lightweight Online Framework For Query Progress Indicators
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 5 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
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
14 years 5 months ago
COLT: continuous on-line tuning
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
Karl Schnaitter, Serge Abiteboul, Tova Milo, Neokl...
CE
2005
91views more  CE 2005»
13 years 5 months ago
Using data mining as a strategy for assessing asynchronous discussion forums
The purpose of this paper is to show how data mining may offer promise as a strategy for discovering and building alternative representations for the data underlying asynchronous ...
Laurie P. Dringus, Timothy Ellis
WWW
2005
ACM
14 years 6 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
ICDE
2008
IEEE
194views Database» more  ICDE 2008»
14 years 6 months ago
P-Cube: Answering Preference Queries in Multi-Dimensional Space
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
Dong Xin, Jiawei Han