Efficient algorithm for reverse furthest neighbor in spatial databases
Efficient algorithm for reverse furthest neighbor in spatial databases
复制标题
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Deng Cheng-y
中科院分区：
文献类型：
--
作者：
Deng Cheng-y
目前，逆最远邻居查询算法的研究在空间数据库中取得了很多成果。但是在空间数据库中，反向最远邻居查询问题并没有得到有效的解决。本文提出了一种新的反向最远邻居查询算法，有效地解决了空间数据库中的反向最远邻居查询问题。该算法采用过滤器-精炼溶液模型。在滤波阶段，提出了反向最远垂直平分线切割方法，该方法可以通过垂直平分线过滤掉这些不是反向k个最远邻居点的点。在细化阶段，提出了反向最远范围细化方法，通过判断该点是否在范围之外来验证该点。实验结果表明了该算法的有效性和高效性。
At present, the reverse furthest neighbor query algorithm research has made a lot of achievements in spatial databases.But the problem of reverse furthest neighbor query is not effectively resolved in spatial databases. In this paper, a new reverse furthest neighbor query algorithm is proposed, which effectively solve the reverse furthest neighbor query problem in spatial databases. The filter-refining solution model is used in this algorithm. In the filter stage, the reverse furthest perpendicular bisector cutting method is put forward, which can filter these points that are not the reverse k furthest neighbor points through the perpendicular bisectors. And in the refining stage, the reverse furthest range- refining method is proposed, which can verify the point by determining whether it is out of the range. The experimental results show that the proposed algorithm is effective and efficiency.