An estimating model for the number of node accesses in NN search

Yaokai Feng, Akifumi Makinouchi

研究成果: Contribution to journalArticle査読

1 被引用数 (Scopus)

抄録

Nearest Neighbor (NN) search has been widely used in spatial databases (e.g., find neighbor cities) and multimedia databases (e.g., similarity search). However, the theoretical analysis on its performance with m (the number of neighbor objects reported finally), n (the cardinality of database) and d (the dimensionality) as parameters has not been done yet. This paper presents an analytical model for estimating performance of the newest NN search algorithm using uniformly distributed objects, focusing on the number of node accesses. The theoretical analysis is verified by experiments.

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

All Science Journal Classification (ASJC) codes

  • ハードウェアとアーキテクチャ
  • 工学(その他)
  • 電子工学および電気工学

フィンガープリント

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

引用スタイル