489 search results - page 71 / 98 » Query Selectivity Estimation via Data Mining |
SDM
2010
SIAM
15 years 1 months ago
2010
SIAM
This paper addresses the challenging problem of learning from multiple annotators whose labeling accuracy (reliability) differs and varies over time. We propose a framework based ...
101
click to vote
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
178
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
WWW
2009
ACM
16 years 12 days ago
2009
ACM
The question of how to publish an anonymized search log was brought to the forefront by a well-intentioned, but privacy-unaware AOL search log release. Since then a series of ad-h...
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...