Sciweavers

32 search results - page 4 / 7
» Efficiently Answering Probabilistic Threshold Top-k Queries ...
Sort
View
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 7 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...
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 9 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
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 9 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
TKDE
2010
274views more  TKDE 2010»
13 years 5 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
SIGMOD
2008
ACM
205views Database» more  SIGMOD 2008»
14 years 7 months ago
Monochromatic and bichromatic reverse skyline search over uncertain databases
Reverse skyline queries over uncertain databases have many important applications such as sensor data monitoring and business planning. Due to the existence of uncertainty in many...
Xiang Lian, Lei Chen 0002