An estimating model for the length of the priority queue in INN search

Yaokai Feng, Akifumi Makinouchi

研究成果: Contribution to journalArticle査読

1 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ(範囲)1-6
ページ数6
ジャーナルResearch Reports on Information Science and Electrical Engineering of Kyushu University
8
1
出版ステータス出版済み - 1 1 2003
外部発表はい

All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンス(全般)
  • 電子工学および電気工学

フィンガープリント

「An estimating model for the length of the priority queue in INN search」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル