By Topic

Bichromatic Reverse Nearest-Neighbor Search in Mobile Systems

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
$33 $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

3 Author(s)
Quoc Thai Tran ; Clayton School of Information Technology, Monash University, Australia ; David Taniar ; Maytham Safar

In traditional reverse nearest-neighbor (RNN) search, the goal is to find the set of interest objects taking the query object as the nearest neighbor given that the interest objects and the query object have the same type. However, when the interest objects and the query object are of different types, this problem is called bichromatic reverse nearest neighbor (BRNN) search. The BRNN query has an increasing number of mobile applications and requires efficient algorithms for processing. In this paper, we present a novel approach for the BRNN search in the context of spatial network databases (SNDB). The main idea behind our approaches is to use Euclidean-based range search to prune the search space and use Euclidean distance in addition to network distance to minimize processing time. Finally, the experimental results confirm that our proposed algorithm have good performance on different network densities.

Published in:

IEEE Systems Journal  (Volume:4 ,  Issue: 2 )