| Summary: | This paper considers <i>k</i>-farthest neighbor (<i>k</i>FN) join queries in spatial networks where the distance between two points is the length of the shortest path connecting them. Given a positive integer <i>k</i>, a set of query points <i>Q</i>, and a set of data points <i>P</i>, the <i>k</i>FN join query retrieves the <i>k</i> data points farthest from each query point in <i>Q</i>. There are many real-life applications using <i>k</i>FN join queries, including artificial intelligence, computational geometry, information retrieval, and pattern recognition. However, the solutions based on the Euclidean distance or nearest neighbor search are not suitable for our purpose due to the difference in the problem definition. Therefore, this paper proposes a cluster nested loop join (CNLJ) algorithm, which clusters query points (data points) into query clusters (data clusters) and reduces the number of <i>k</i>FN queries required to perform the <i>k</i>FN join. An empirical study was performed using real-life roadmaps to confirm the superiority and scalability of the CNLJ algorithm compared to the conventional solutions in various conditions.
|
|---|