2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations Taipei, Taiwan May 18-May 20 ISBN: 978-0-7695-3650-7
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MDM.2009.16
A nearest neighbor query is an important notion in spatial databases and moving object databases.In the emerging application fields of moving object technologies, such as mobile sensors and mobile robotics, the location of an object is often imprecise due to noise and estimation errors.We propose techniques for processing a nearest neighbor query when the location of the query object is specified by an imprecise Gaussian distribution. First, we consider two query processing strategies for pruning candidate objects, which can reduce the number of objects that require numerical integration for computing the qualification probabilities.In addition, we consider a hybrid approach that combines the two strategies. The performance of the proposed methods is evaluated using test data.
Index Terms:
imprecise locations, nearest neighbor queries, spatial databases, Gaussian distributions
Citation:
Yuichi Iijima, Yoshiharu Ishikawa, "Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations," mdm, pp.52-61, 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb