211 search results - page 17 / 43 » Ranked Query Processing in Uncertain Databases |
96
Voted
WWW
2006
ACM
16 years 11 days 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...
103
click to vote
SPIRE
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The di...
128
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
172
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
SEMWEB
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...