CAJ | 학술논문

在欧式空间下反最远邻查询算法的研究已取得了很多成果，但反最远邻查询问题还未得到有效解决。本文提出一种反最远邻查询算法，有效地解决了反最远邻查询问题，查询算法采用了过滤-提炼的解决模型。在过滤阶段，提出了反远中垂线裁剪方法。该裁剪法是通过做中垂线来过滤不是查询点的反最远邻的点。在提炼阶段，提出了反远范围查询提炼方法。该提炼方法是通过判断对象点是否在设定的范围外来验证该点是否是查询点的反最远邻。最后通过实验验证了所提算法的有效性。
재구식공간하반최원린사순산법적연구이취득료흔다성과，단반최원린사순문제환미득도유효해결。본문제출일충반최원린사순산법，유효지해결료반최원린사순문제，사순산법채용료과려-제련적해결모형。재과려계단，제출료반원중수선재전방법。해재전법시통과주중수선래과려불시사순점적반최원린적점。재제련계단，제출료반원범위사순제련방법。해제련방법시통과판단대상점시부재설정적범위외래험증해점시부시사순점적반최원린。최후통과실험험증료소제산법적유효성。
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 dat-abases. 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 perpen-dicular 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.