Sciweavers

173 search results - page 3 / 35
» Efficient Rank Based KNN Query Processing Over Uncertain Dat...
Sort
View
CIKM
2006
Springer
13 years 9 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
2007
IEEE
173views Database» more  ICDE 2007»
14 years 7 months ago
Top-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
WAIM
2009
Springer
14 years 20 days ago
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggrega...
Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Li...
VLDB
2011
ACM
276views Database» more  VLDB 2011»
13 years 1 months ago
Ranking queries on uncertain data
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Xuemin Lin
PVLDB
2010
152views more  PVLDB 2010»
13 years 4 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...