Efficient Computation of Range Aggregates Against Uncertain Location Based Queries
Query imprecision or uncertainty may be often caused by the nature of many applications, including location based services. The existing techniques for processing location based spatial queries regarding certain query points and data points are not applicable or inefficient when uncertain queries are involved. In this paper, the authors investigate the problem of efficiently computing distance based range aggregates over certain data points and uncertain query points as described in the paper. In general, an uncertain query Q is a multi-dimensional point that might appear at any location x following a probabilistic density function pdf(x) within a region Q.region.