By Topic

VN-tree for efficient nearest neighbors search in location based services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Slimani, H. ; Comput. Sci. Dept., Fac. of Sci. of Tunis, Tunis, Tunisia ; Najjar, F.

Nearest neighbors queries are commonly used in location based services. This paper focuses on enhancing their processing based on indexing structures. Indexes, like R-trees, cannot avoid backtracking to process them. This feature weakens suitability of such an index to several data access modes within mobile environments. To meet needs of these environments, we propose a novel index called VN-tree (Voronoi-Neighbors tree), based on the Voronoi diagram and its dual graph (the Delaunay Triangulation) of the candidate points of interest. VN-tree adopts a non-overlapping partitioning scheme and supports backtracking-free search algorithms to answer several types of queries. In particular, processing continuous nearest neighbor queries is a straightforward use of VN-tree. We conduct various experiments to compare VN-tree with R*-tree as in-memory indexes in the on-demand data access mode. Main results show that VN-tree consistently provides outstanding performances.

Published in:

Wireless Communications and Mobile Computing Conference (IWCMC), 2011 7th International

Date of Conference:

4-8 July 2011