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

Yaokai Feng, Akifumi Makinouchi

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)87-92
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume7
Issue number2
Publication statusPublished - Sep 2002
Externally publishedYes

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Cite this