A Cost Model for Incremental Nearest Neighbor Search in Multidimensional Spaces
Jeju City（2007）
摘要
Nearest Neighbor (NN) search has been widely used in spatial databases and multimedia databases. Incre- mental NN (INN) search is regarded as the optimal NN search because of the minimum number of node ac- cesses and it can be used no matter whether the num- ber 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 al- gorithm on R*-tree. The theoretical analysis is verified by experiments.
更多查看译文
关键词
analytical model,inn search al,multimedia databases,mental nn,cost model,optimal nn search,node ac,spatial databases,nearest neighbor,incremental nearest neighbor search,dimensional index,minimum number,multidimensional spaces,spatial database,information retrieval,nearest neighbor search,search algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要