抜粋
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 |
| 外部発表 | Yes |
フィンガープリント
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Engineering (miscellaneous)
- Electrical and Electronic Engineering
これを引用
Feng, Y., & Makinouchi, A. (2002). An estimating model for the number of node accesses in NN search. Research Reports on Information Science and Electrical Engineering of Kyushu University, 7(2), 87-92.