Research Article
Efficient Processing of Moving k-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks
Figure 4
Three scenarios for processing MkRNN queries.
| (a) submits a RNN query for a query region to the server at time , where |
| (b) submits a RNN query for an updated query region to the server when leaves at |
| (c) Server requests that updates the query region when a set of candidate objects is invalidated at |