关键词: 削减空间 连续 反最近邻

Abstract:

The reverse nearest neighbor search in dynamic environments is becoming a hot topic, and an efficient space trimming method is the bottleneck of such a search. First, a formal definition of CRNN is given and a deep analysis of the problem is followed. Second, based on the analysis of the existing trimming methods, the paper presents a novel space-trimming algorithm, which can be applied to continuous reverse nearest neighbor search. The algorithm can  reduce I/O access efficiently and guarantee the precision of the result. In addition, it does not rely on specific indices or search algorithms. Experi ments show that the algorithm can efficiently eliminate the nodes which do not contain true RNNs and hence improve the efficiency of CRNN search.

Key words: trimming space;continuous;reverse nearest neighbor