Evaluation of Uncertain Location

  title={Evaluation of Uncertain Location},
  author={D. Sujay},
  journal={IOSR Journal of Computer Engineering},
  • D. Sujay
  • Published 2012
  • Computer Science
  • IOSR Journal of Computer Engineering
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. We propose novel, efficient techniques to solve the problem following the filtering-and- verification paradigm. Keywords: Uncertainty,Range aggregates,filtering-and-verification 


Probabilistic Spatial Queries on Existentially Uncertain Data
This work proposes adaptations of spatial access methods and search algorithms for probabilistic versions of range queries and nearest neighbors and conducts an extensive experimental study, which evaluates the effectiveness of proposed solutions. Expand
Efficient Evaluation of Imprecise Location-Dependent Queries
Three methods to improve the efficiency of queries that return probabilistic guarantees for location data with uncertainty are developed and Experimental simulation over a realistic dataset reveals that these approaches improve the query performance significantly. Expand
Ranking queries on uncertain data: a probabilistic threshold approach
An efficient exact algorithm, a fast sampling algorithm, and a Poisson approximation based algorithm are presented for answering probabilistic threshold top-k queries on uncertain data, which computes uncertain records taking a probability of at least p to be in the top- k list. Expand
On the Effect of Location Uncertainty in Spatial Querying
This paper presents the first theoretical analysis that estimates the average number of false hits introduced in the results of rectangular range queries in the case of data points uniformly distributed in 2D space and relax the original distribution assumptions showing how to deal with arbitrarily distributed data points and more realistic location uncertainty distributions. Expand
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data
This paper develops two index structures and associated algorithms to efficiently answer Probabilistic Threshold Queries (PTQs), and establishes the difficulty of this problem by mapping one-dimensional intervals to a two-dimensional space, and shows that the problem of intervals indexing with probabilities is significantly harder than interval indexing which is considered a well-studied problem. Expand
Efficient join processing over uncertain data
This paper proposes a semantics for the join operation, defines probabilistic operators over uncertain data, and proposes join algorithms that provide efficient execution of Probabilistic threshold joins. Expand
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
The constrained nearest-neighbor query (C-PNN) is proposed, which returns the IDs of objects whose probabilities are higher than some threshold, with a given error bound in the answers. Expand
Indexing uncertain data
This paper presents various indexing schemes with linear or near-linear space and logarithmic query time, and extends to the external memory model in which the goal is to minimize the number of disk accesses when querying the index. Expand
Efficient Clustering of Uncertain Data
This work studies various pruning methods to avoid expensive expected distance calculation in the UK-means algorithm, which is based on the traditional K-mean algorithm. Expand
Evaluating probabilistic queries over imprecise data
This paper addresses the important issue of measuring the quality of the answers to query evaluation based upon uncertain data, and provides algorithms for efficiently pulling data from relevant sensors or moving objects in order to improve thequality of the executing queries. Expand