Abstract
In this paper, we studied the problem of reverse k nearest neighbors (RkNN) in directed road network, where a road segment can have a particular orientation. A RNN query returns a set of data objects that take query point as their nearest neighbor. Although, much research has been done for RNN in Euclidean and undirected network space, very less attention has been paid to directed road network, where network distances are not symmetric. In this paper, we provided pruning rules which are used to minimize the network expansion while searching for the result of a RNN query. Based on these pruning rules we provide an algorithm named SWIFT for answering RNN queries in static directed road network. We evaluated SWIFT on a real world road network and our experimental results show that SWIFT significantly outperforms the naive algorithm in terms of computational cost.
Highlights
Spatial databases offer large number of services such as nearest neighbor, resource allocation, and preferential search etc
We present an algorithm for calculation of moving reverse k nearest neighbors (RkNN) in a directed road networks
Safe exit points are the boundary points of the safe region and since safe region is comprised of road segments and safe exit points are just points in the road network, as a result less network bandwidth is consumed during communication
Summary
Spatial databases offer large number of services such as nearest neighbor, resource allocation, and preferential search etc. People rely on locationbased services to plan and manage their trips This new demand for location-aware services has resulted in development of efficient algorithms and many novel query types for spatial databases. We study safe region of a reverse nearest neighbor query for a moving query and static data objects in a directed road network(i.e., each road is either directed or undirected). The main problem in continuous reverse nearest neighbor query is how to maintain the freshness of the query result, as the query object is moving freely and arbitrarily. We present an algorithm for calculation of moving RkNN in a directed road networks. We discuss why RkNN algorithm for undirected road is not applicable to directed road networks.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
