TY - GEN
T1 - A simple routing method for reverse k-nearest neighbor queries in spatial networks
AU - Gotoh, Yusuke
PY - 2014/1/26
Y1 - 2014/1/26
N2 - Due to the recent popularization of Geographic Information Systems (GIS), spatial network environments that can display the changes of spatial axes in mobile phones have received much attention. In addition, many users use location-based services, which are one input devices of GIS. Many researchers have proposed methods of k-Nearest Neighbor (kNN) search that have a bi-directional relationship from a query object to a target object. Several methods have also proposed reverse k-nearest neighbor (RkNN) searches. The RkNN method considers the inverse direction with the position between query and target objects. In this paper, we propose and evaluate a simple routing method for reverse k-nearest neighbor queries in spatial networks that uses the bichromatic reverse k-nearest neighbor search and considers the rectangular region including the exact point of each object. We show the region, where the relationship between the query and target objects is not changed, and identify the route to a destination for a moving object.
AB - Due to the recent popularization of Geographic Information Systems (GIS), spatial network environments that can display the changes of spatial axes in mobile phones have received much attention. In addition, many users use location-based services, which are one input devices of GIS. Many researchers have proposed methods of k-Nearest Neighbor (kNN) search that have a bi-directional relationship from a query object to a target object. Several methods have also proposed reverse k-nearest neighbor (RkNN) searches. The RkNN method considers the inverse direction with the position between query and target objects. In this paper, we propose and evaluate a simple routing method for reverse k-nearest neighbor queries in spatial networks that uses the bichromatic reverse k-nearest neighbor search and considers the rectangular region including the exact point of each object. We show the region, where the relationship between the query and target objects is not changed, and identify the route to a destination for a moving object.
KW - Reverse k-nearest neighbor query
KW - Routing
KW - Spatial network
UR - http://www.scopus.com/inward/record.url?scp=84946686048&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84946686048&partnerID=8YFLogxK
U2 - 10.1109/NBiS.2014.55
DO - 10.1109/NBiS.2014.55
M3 - Conference contribution
AN - SCOPUS:84946686048
T3 - Proceedings - 2014 International Conference on Network-Based Information Systems, NBiS 2014
SP - 615
EP - 620
BT - Proceedings - 2014 International Conference on Network-Based Information Systems, NBiS 2014
A2 - Barolli, Leonard
A2 - Takizawa, Makoto
A2 - Enokido, Tomoya
A2 - Xhafa, Fatos
A2 - De Santis, Alfredo
A2 - Castiglione, Aniello
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 17th International Conference on Network-Based Information Systems, NBiS 2014
Y2 - 10 September 2014 through 12 September 2014
ER -