The Internet Archive has a preservation copy of this work in our general collections.
The file type is
In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach supports a general uncertainty model using continuous probabilistic density functions to describe the (possibly correlated) uncertain attributes of objects. In a nutshell, the problem to be solved is to compute the PDF of the random variable denoted by the probabilistic domination count: Given an uncertain database object B, an uncertainarXiv:1101.2613v2 fatcat:zbycba6jhzgxvifkwmlh5dgrxu