Efficiently answering probabilistic threshold top-k queries on uncertain data

被引:29
作者
Hua, Ming [1 ]
Pei, Jian [1 ]
Zhang, Wenjie [2 ]
Lin, Xuemin [2 ]
机构
[1] Simon Fraser Univ, Burnaby, BC V5A 1S6, Canada
[2] Univ New S Wales, NICTA, Sydney, NSW, Australia
来源
2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3 | 2008年
关键词
D O I
10.1109/ICDE.2008.4497570
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a novel type of probabilistic threshold top-k queries on uncertain data, and give an exact algorithm. More details can be found in [4].
引用
收藏
页码:1403 / +
页数:2
相关论文
共 8 条
[1]  
ABITEBOUL S, SIGMOD 87
[2]  
BENJELLOUN O, VLDB 06
[3]   Optimal aggregation algorithms for middleware [J].
Fagin, R ;
Lotem, A ;
Naor, M .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (04) :614-656
[4]  
HUA M, 200726 TR S FRAS U S
[5]   INCOMPLETE INFORMATION IN RELATIONAL DATABASES [J].
IMIELINSKI, T ;
LIPSKI, W .
JOURNAL OF THE ACM, 1984, 31 (04) :761-791
[6]  
PEI J, VLDB 07
[7]  
SARMA AD, ICDE 06
[8]  
SOLIMAN MA, ICDE 07