Sciweavers

540 search results - page 2 / 108
» Ranking with Uncertain Scores
Sort
View
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 8 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 7 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 5 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
CIKM
2001
Springer
13 years 9 months ago
Merging Techniques for Performing Data Fusion on the Web
Data fusion on the Web refers to the merging, into a unified single list, of the ranked document lists, which are retrieved in response to a user query by more than one Web search...
Theodora Tsikrika, Mounia Lalmas
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
14 years 5 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...