Sciweavers

627 search results - page 15 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
15 years 11 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
15 years 11 months ago
Confidence-Aware Join Algorithms
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
Parag Agrawal, Jennifer Widom
SSD
2005
Springer
175views Database» more  SSD 2005»
15 years 2 months ago
Probabilistic Spatial Queries on Existentially Uncertain Data
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei...
CIKM
2006
Springer
15 years 1 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
15 years 11 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