Nearest Neighbor (NN) search has been widely used in spatial databases and multimedia databases. Incremental NN (INN) search is regarded as the optimal NN search because of the minimum number of node accesses and it can be used no matter whether the number of objects to be retrieved is fixed or not in advance. R*-tree is still regarded as being among the best high-dimensional indices. This paper presents an analytical model for estimating performance of the INN search algorithm on R*-tree. The theoretical analysis is verified by experiments.
展开▼
机译：最近的邻居（NN）搜索已广泛用于空间数据库和多媒体数据库。增量NN（INN）搜索被视为最佳NN搜索，因为节点访问的最小数量，无论要检索的对象数是否已预先固定，都可以使用它。 r * -tree仍被视为最好的高维指数。本文介绍了一个分析模型，用于估算Inn搜索算法在R * -tree上的性能。实验验证了理论分析。
展开▼
