Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks
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 neighb...
Main Authors: | Muhammad Attique, Hyung-Ju Cho, Rize Jin, Tae-Sun Chung |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2016-12-01
|
Series: | ISPRS International Journal of Geo-Information |
Subjects: | |
Online Access: | http://www.mdpi.com/2220-9964/5/12/247 |
Similar Items
-
A Pruning Algorithm for Reverse Nearest Neighbors in Directed Road Networks
by: Rizwan Qamar, et al.
Published: (2015-11-01) -
Efficient Processing of All Nearest Neighbor Queries in Dynamic Road Networks
by: Aavash Bhandari, et al.
Published: (2021-05-01) -
ParSCL: A Parallel and Distributed Framework to Process All Nearest Neighbor Queries on a Road Network
by: Aavash Bhandari, et al.
Published: (2023-01-01) -
Direction-Aware Continuous Moving <i>K</i>-Nearest-Neighbor Query in Road Networks
by: Tianyang Dong, et al.
Published: (2019-08-01) -
Clustering Algorithm for Constructing Connected Graphs with Reverse Nearest Neighbors
by: LONG Jianwu, WANG Qiang
Published: (2023-11-01)