@inproceedings{e9c05c61d9d4409dab113c98ccf0b991,
title = "A cost model for incremental nearest neighbor search in multidimensional spaces",
abstract = "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.",
author = "Yaokai Feng and Akifumi Makinouchi and Kunihiko Kaneko",
year = "2007",
month = dec,
day = "1",
doi = "10.1109/IPC.2007.20",
language = "English",
isbn = "0769530060",
series = "Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007",
pages = "111--116",
booktitle = "Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007",
note = "2007 International Conference on Intelligent Pervasive Computing, IPC 2007 ; Conference date: 11-10-2007 Through 13-10-2007",
}