Welcome to Project Solutions !

Project Solutions is the leading final year engineering project providers for IT and Computer Science students across India

Efficient Computation of Range Aggregates against Uncertain Location Based Queries

NameEfficient Computation of Range Aggregates against Uncertain Location Based Queries
Categorydata mining

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 S_ of S such that for each p ∈ 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..

is ieee
ieee paper year2012
price rangemedium
Share this google icon

Get a Call Back

related projects

more projects+


Total 0 comments.
    view all

Post your comment

(It will not be published)