Efficient Computation of Range Aggregates Against Uncertain Location Based Queries in Multi Dimensional Space |
( Volume 3 Issue 2,February 2016 ) OPEN ACCESS |
Author(s): |
R.Saravanan, S.Gokulakrishnan, T.V.Sampath |
Abstract: |
In many applications, including location based services, queries may not be precise. In this paper, we study the problem of efficiently computing range aggregates in a multidimensional space when the query location is uncertain. Specifically, for a query point Q whose location is uncertain and a set S of points in a multi-dimensional space, we want to calculate the aggregate (e.g., count, average and sum) over the subset SI of S, Q has at least probability θ within the distance γ to p. We propose novel, efficient techniques to solve the problem following the filtering-and-verification paradigm. In particular, two novel filtering techniques are proposed to effectively and efficiently remove data points from verification. Our comprehensive experiments based on both real and synthetic data demonstrate the efficiency and scalability of our techniques. |
Paper Statistics: |
Cite this Article: |
Click here to get all Styles of Citation using DOI of the article. |