Efficient Processing of Moving k-Range Nearest Neighbor Queries in Directed and Dynamic Spatial Networks

Algorithm 3

Monitor_safe_segments (, ).

Input: : influential region, : updated edge

Output: none

(1)  if    then                                      // an update to edge that does not overlap is ignored.

(2)  ignore the update in the weight of edge

(3)  else                     // this means that

(4)   Update_query_region ()       // server requests that update the query region

(5)   Evaluate_RNN_query (, )          // server evaluates RNN query for an updated query region

(6)   Update_safe_segments (, )         // determines safe segments inside the updated query region

(7)   Update_influential_region (, )       // server updates influential region accordingly.