Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 87-92 |
| Number of pages | 6 |
| Journal | Research Reports on Information Science and Electrical Engineering of Kyushu University |
| Volume | 7 |
| Issue number | 2 |
| Publication status | Published - Sep 2002 |
| Externally published | Yes |
Fingerprint
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Engineering (miscellaneous)
- Electrical and Electronic Engineering
Cite this
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.