摘要
反最近邻(RNN)查询问题是空间数据库中的研究热点问题,但传统算法主要集中在对整个数据集的查询。该文把约束关系的概念引入到了RNN查询中,给出在约束关系下如何利用索引结构进行查询的方法,并根据NN查询和RNN查询问题的内在联系给出相应求解CRNN问题的算法。实验表明该算法比传统算法更能提高查询效率。
Reverse Nearest Neighbor（RNN） queries are of activity area in spatial database. However, most of the traditional algorithms find the RNN in the whole data set. This paper combines constrained relationship with RNN queries and some methods are proposed. It also gives some ways to solve the problem of Constrained Reverse Nearest Neighbor（CRNN） with the internal relationship between Nearest Neighbor（NN） queries and RNN queries. As is shown by the experiments, this algorithm can improve the query efficiency compared with the traditional ones.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第16期69-71,共3页
Computer Engineering
关键词
最近邻查询
反近邻查询
约束关系反最近邻
约束关系
Nearest Neighbor（NN） queries
Reverse Nearest Neighbor（RNN） queries
Constrained Reverse Nearest Neighbor（CRNN）
constrained relationship
