Cluster Nested Loop k-Farthest Neighbor Join Algorithm for Spatial Networks
HJ Cho - ISPRS International Journal of Geo-Information, 2022 - mdpi.com
This paper considers k-farthest neighbor (k FN) join queries in spatial networks where the
distance between two points is the length of the shortest path connecting them. Given a …
distance between two points is the length of the shortest path connecting them. Given a …
The Efficient Processing of Moving k-Farthest Neighbor Queries in Road Networks
HJ Cho - Algorithms, 2022 - mdpi.com
Given a set of facilities F and a query point q, ak-farthest neighbor (k FN) query returns the k
farthest facilities f 1, f 1,⋯, fk from q. This study considers the moving k-farthest neighbor (M k …
farthest facilities f 1, f 1,⋯, fk from q. This study considers the moving k-farthest neighbor (M k …
A Novel Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search on Angular Distance
T Liu - 2021 - researchspace.auckland.ac.nz
We present a novel locality-sensitive filtering (LSF) method for approximate nearest
neighbor search on angular distance. It is based on the theory of concomitants of extreme …
neighbor search on angular distance. It is based on the theory of concomitants of extreme …