Method of reverse nearest neighbor queries using VARdnn-Tree
一种基于VARdnn-Tree的反向最近邻查询方法*

In spatial databases, the improved R-Tree is usually used as indexing structure in the research of low-dimension reverse nearest neighbor queries. Queries by indexing structures such as R-Tree will cause dimension disaster in high-dimension because of the limitation of tree indexing structure. To solve the problem, this paper proposed an indexing structure based on VARdnn-Tree. It adoped the method of the quantification compression to store data, thus could effectively support queries in high-dimension.