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

Algorithm 1

MORAN (Q, k).

Input: Q: query region, k: the number of requested NNs

Output: : the set of safe segments in

(1)                       // is initialized to an empty set

(2) for each segment   do

(3)   evaluate_kNN_query_at_point (, k)      // a kNN query is evaluated at a boundary point

(4)   evaluate_kNN_query_at_point (, k)     // a kNN query is evaluated at a boundary point

(5)   evaluate_range_query ()         // a range query is evaluated for a segment

(6)   find_safe_segments (, , )    // the function is detailed in Section 4.2

(7)  

(8) return                       // the set of safe segments is provided to the query issuer