A cost model for incremental nearest neighbor search in multidimensional spaces

Yaokai Feng, Akifumi Makinouchi, Kunihiko Kaneko

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007
ページ111-116
ページ数6
DOI
出版ステータス出版済み - 12 1 2007
イベント2007 International Conference on Intelligent Pervasive Computing, IPC 2007 - Jeju Island, 大韓民国
継続期間: 10 11 200710 13 2007

出版物シリーズ

名前Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007

その他

その他2007 International Conference on Intelligent Pervasive Computing, IPC 2007
Country大韓民国
CityJeju Island
Period10/11/0710/13/07

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Networks and Communications
  • Software

フィンガープリント 「A cost model for incremental nearest neighbor search in multidimensional spaces」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル