Sciweavers

211 search results - page 2 / 43
» Ranked Query Processing in Uncertain Databases
Sort
View
PVLDB
2010
158views more  PVLDB 2010»
13 years 3 months ago
Building Ranked Mashups of Unstructured Sources with Uncertain Information
Mashups are situational applications that join multiple sources to better meet the information needs of Web users. Web sources can be huge databases behind query interfaces, which...
Mohamed A. Soliman, Ihab F. Ilyas, Mina Saleeb
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 6 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
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...
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
13 years 9 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...
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 5 months ago
Probabilistic ranked queries 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, ...
Xiang Lian, Lei Chen 0002