Sciweavers

105 search results - page 4 / 21
» Probabilistic ranked queries in uncertain databases
Sort
View
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 10 days ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 5 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
13 years 10 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
TKDE
2008
234views more  TKDE 2008»
13 years 5 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
VLDB
2010
ACM
227views Database» more  VLDB 2010»
13 years 3 months ago
Supporting ranking queries on uncertain and incomplete data
Mohamed A. Soliman, Ihab F. Ilyas, Shalev Ben-Davi...