Sciweavers

785 search results - page 7 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
14 years 9 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
14 years 1 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz
SIGMOD
2008
ACM
115views Database» more  SIGMOD 2008»
14 years 7 months ago
Query answering techniques on uncertain and probabilistic data: tutorial summary
Uncertain data are inherent in some important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of thos...
Jian Pei, Ming Hua, Yufei Tao, Xuemin Lin
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
12 years 10 months ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
EDBT
2009
ACM
115views Database» more  EDBT 2009»
14 years 2 months ago
Top-k dominating queries in uncertain databases
Due to the existence of uncertain data in a wide spectrum of real applications, uncertain query processing has become increasingly important, which dramatically differs from handl...
Xiang Lian, Lei Chen 0002