9 search results - page 1 / 2 » Top-k dominating queries in uncertain databases |
ICDE
2008
IEEE
14 years 5 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
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...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
SIGMOD
2011
ACM
12 years 7 months ago
2011
ACM
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...
ICDE
2008
IEEE
14 years 5 months ago
2008
IEEE
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...