Efficient Shared Execution Processing of k-Nearest Neighbor Joins in Road Networks

Algorithm 6

.

Input: : number of inner objects retrieved for an outer object, : outer segment, : set of candidate inner objects
Output: : a partial join result for outer objects in
(1)	⁡   // is initialized to the empty set
(2)	for each outer object do
(3)	// in Algorithm 4 is performed
(4)	⁡⁡⁡⁡   // a partial join result for is generated from
(5)
(6)	return   // is returned after all outer objects in have been processed