Research of Bichromatic Reverse Nearest Neighbor Search for Spatial Objects
Yang Xiu-juan
Abstract
Yang Xiu-juan
Abstract
One of the most important algorithms in spatial database is reverse nearest neighbor query.There are two cases of Reverse Nearest Neighbor queries,namely,bichromatic RNN and monochromatic RNN.Usually Reverse Nearest Neighbor are referred to monochromatic RNN,and bichromatic have not researched.In view of this situation,this paper proposed a bichromatic reverse nearest neighbor query algorithm using half-space trimming strategy.After analysis and experiments,this algorithm can search bichromatic reverse nearest neighbor.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
One of the most important algorithms in spatial database is reverse nearest neighbor query.There are two cases of Reverse Nearest Neighbor queries,namely,bichromatic RNN and monochromatic RNN.Usually Reverse Nearest Neighbor are referred to monochromatic RNN,and bichromatic have not researched.In view of this situation,this paper proposed a bichromatic reverse nearest neighbor query algorithm using half-space trimming strategy.After analysis and experiments,this algorithm can search bichromatic reverse nearest neighbor.
Key concepts: k-nearest neighbors algorithm, Nearest neighbor search, Best bin first, Fixed-radius near neighbors, Nearest-neighbor chain algorithm, Computer science, Nearest neighbor graph, Trimming