Incremental Nearest Neighbor (INN) search has been widely used in spatial databases and multimedia databases. R*-tree is still regarded as being among the best multi-dimensional indices. This paper presents an analytical model for estimating performance of the INN search algorithm on R*-tree. Our model focuses on the length of the priority queue, the total number of its members. In our model, the particularity on the number of entries in the root node and the possible difference of fanouts between the leaf nodes and the other nodes are taken into account. The theoretical analysis is verified by experiments.
|ジャーナル||Research Reports on Information Science and Electrical Engineering of Kyushu University|
|出版ステータス||出版済み - 1 1 2003|
All Science Journal Classification (ASJC) codes
- コンピュータ サイエンス（全般）