Abstract
A reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k closest points. In recent years, considerable research has been conducted into monitoring reverse k nearest neighbor queries. In this paper, we study the problem of continuous reverse nearest neighbor queries where both the query object q and data objects are moving. Existing state-of-the-art techniques are sensitive towards the movement of data objects, e.g., a candidate object must be verified whenever it changes its location. Further, insufficient attention has been given to the monitoring of RNN queries in dynamic road networks where the network weight changes depending on the traffic conditions. In this paper, we address these problems by proposing a new safe exit-based algorithm called CORE-X for efficiently computing the safe exit points of both query and data objects. The safe exit point of an object indicates the point at which its safe region and non-safe region meet, thus a set of safe exit points represents the border of the safe region. Within the safe region, the query result remains unchanged provided the query and data objects remain inside their respective safe regions. The results of extensive experiments conducted using real road maps indicate that the proposed algorithm significantly reduces communication and computation costs compared to the state-of-the-art algorithm.
Highlights
The rapid technological advances in wireless networks and development of handheld devices equipped with location sensing technology have popularized location-based services in the past decades
Considerable effort has been devoted to moving-query processing [3,4,5,6,7], these studies have focused on range queries and nearest neighbor (NN) queries; there continues to be a deficiency of research addressing continuous reverse nearest neighbor (RNN) queries
We present a framework for continuous monitoring of reverse k nearest neighbor (RkNN) queries where both query and data objects are moving on a road network
Summary
The rapid technological advances in wireless networks and development of handheld devices equipped with location sensing technology (e.g., smart phones and tablets) have popularized location-based services in the past decades. To address the aforementioned limitation, we present a safe exit-based approach for continuous monitoring of reverse k nearest queries in a road network where both query objects and data objects move arbitrarily. The proposed algorithm computes safe exit points for both query and data objects. We first consider the continuous monitoring of reverse k nearest queries in static road networks where the network distance does not change over time. We present a framework for continuous monitoring of RkNN queries where both query and data objects are moving on a road network.
Sign-in/Register to view highlights & summary 
Published Version (
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