Let P be a set of n uncertain points in R d, where each point pi∈ P is associated with a real
value vi and exists with probability α i∈(0, 1] independently of the other points. We present
algorithms for building an index on P so that for a d-dimensional query rectangle ρ, the
expected maximum value or the most-likely maximum value in ρ can be computed quickly.
Our main contributions include the following:(i) The first index of sub-quadratic size to
achieve a sub-linear query time in any dimension.(ii) A conditional lower bound for most …

Let P be a set of n uncertain points in Red, where each point pi∈ P is associated with a real
value vi and a probability αi∈(0, 1] of existence, ie, each pi exists with an independent
probability αi. We present algorithms for building an index on P so that for a d-dimensional
query rectangle ρ, the expected maximum value or the most-likely maximum value in ρ can
be computed quickly. The specific contributions of our paper include the following:(i) The first
index of sub-quadratic size to achieve a sub-linear query time in any dimension d≥ 1. It also …