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.
|ジャーナル||Research Reports on Information Science and Electrical Engineering of Kyushu University|
|出版ステータス||出版済み - 9月 2002|
!!!All Science Journal Classification (ASJC) codes