燕山大学学报Issue(5)：412-419,8.DOI:10.3969/j.issn.1007-791X.2013.05.007
空间数据库中反最远邻查询方法
Efficient algorithm for reverse furthest neighbor in spatial databases
邓成玉 1彭川 2王宝文 1刘文远 1吴晓光2
作者信息
- 1. 燕山大学 信息科学与工程学院，河北 秦皇岛 066004
- 2. 河北省计算机虚拟技术与系统集成重点实验室，河北 秦皇岛 066004
- 折叠
摘要
Abstract
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.关键词
空间数据库/反/最远邻Key words
spatial database/reverse furthest neighbor/furthest neighbor分类
信息技术与安全科学引用本文复制引用
邓成玉,彭川,王宝文,刘文远,吴晓光..空间数据库中反最远邻查询方法[J].燕山大学学报,2013,(5):412-419,8.
