627 search results - page 2 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
WWW
2006
ACM
15 years 10 months ago
2006
ACM
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
109
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
JCIT
2010
14 years 4 months ago
2010
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
106
click to vote
WWW
2006
ACM
15 years 10 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
106
click to vote
DAWAK
2007
Springer
15 years 3 months ago
2007
Springer
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...