Efficiently answering probabilistic threshold top-k queries on uncertain data
Publication
, Conference
Hua, M; Pei, J; Zhang, W; Lin, X
Published in: Proceedings - International Conference on Data Engineering
October 1, 2008
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]. © 2008 IEEE.
Duke Scholars
Published In
Proceedings - International Conference on Data Engineering
DOI
ISSN
1084-4627
Publication Date
October 1, 2008
Start / End Page
1403 / 1405
Citation
APA
Chicago
ICMJE
MLA
NLM
Hua, M., Pei, J., Zhang, W., & Lin, X. (2008). Efficiently answering probabilistic threshold top-k queries on uncertain data. In Proceedings - International Conference on Data Engineering (pp. 1403–1405). https://doi.org/10.1109/ICDE.2008.4497570
Hua, M., J. Pei, W. Zhang, and X. Lin. “Efficiently answering probabilistic threshold top-k queries on uncertain data.” In Proceedings - International Conference on Data Engineering, 1403–5, 2008. https://doi.org/10.1109/ICDE.2008.4497570.
Hua M, Pei J, Zhang W, Lin X. Efficiently answering probabilistic threshold top-k queries on uncertain data. In: Proceedings - International Conference on Data Engineering. 2008. p. 1403–5.
Hua, M., et al. “Efficiently answering probabilistic threshold top-k queries on uncertain data.” Proceedings - International Conference on Data Engineering, 2008, pp. 1403–05. Scopus, doi:10.1109/ICDE.2008.4497570.
Hua M, Pei J, Zhang W, Lin X. Efficiently answering probabilistic threshold top-k queries on uncertain data. Proceedings - International Conference on Data Engineering. 2008. p. 1403–1405.
Published In
Proceedings - International Conference on Data Engineering
DOI
ISSN
1084-4627
Publication Date
October 1, 2008
Start / End Page
1403 / 1405