A cost model for incremental nearest neighbor search in multidimensional spaces

Yaokai Feng, Akifumi Makinouchi, Kunihiko Kaneko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007
Pages111-116
Number of pages6
DOIs
Publication statusPublished - Dec 1 2007
Event2007 International Conference on Intelligent Pervasive Computing, IPC 2007 - Jeju Island, Korea, Republic of
Duration: Oct 11 2007Oct 13 2007

Publication series

NameProceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007

Other

Other2007 International Conference on Intelligent Pervasive Computing, IPC 2007
CountryKorea, Republic of
CityJeju Island
Period10/11/0710/13/07

Fingerprint

Costs
Analytical models
Nearest neighbor search
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Networks and Communications
  • Software

Cite this

Feng, Y., Makinouchi, A., & Kaneko, K. (2007). A cost model for incremental nearest neighbor search in multidimensional spaces. In Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007 (pp. 111-116). [4438406] (Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007). https://doi.org/10.1109/IPC.2007.20

A cost model for incremental nearest neighbor search in multidimensional spaces. / Feng, Yaokai; Makinouchi, Akifumi; Kaneko, Kunihiko.

Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007. 2007. p. 111-116 4438406 (Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Feng, Y, Makinouchi, A & Kaneko, K 2007, A cost model for incremental nearest neighbor search in multidimensional spaces. in Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007., 4438406, Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007, pp. 111-116, 2007 International Conference on Intelligent Pervasive Computing, IPC 2007, Jeju Island, Korea, Republic of, 10/11/07. https://doi.org/10.1109/IPC.2007.20
Feng Y, Makinouchi A, Kaneko K. A cost model for incremental nearest neighbor search in multidimensional spaces. In Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007. 2007. p. 111-116. 4438406. (Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007). https://doi.org/10.1109/IPC.2007.20
Feng, Yaokai ; Makinouchi, Akifumi ; Kaneko, Kunihiko. / A cost model for incremental nearest neighbor search in multidimensional spaces. Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007. 2007. pp. 111-116 (Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007).
@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 = "12",
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",

}

TY - GEN

T1 - A cost model for incremental nearest neighbor search in multidimensional spaces

AU - Feng, Yaokai

AU - Makinouchi, Akifumi

AU - Kaneko, Kunihiko

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50249119641&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50249119641&partnerID=8YFLogxK

U2 - 10.1109/IPC.2007.20

DO - 10.1109/IPC.2007.20

M3 - Conference contribution

AN - SCOPUS:50249119641

SN - 0769530060

SN - 9780769530062

T3 - Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007

SP - 111

EP - 116

BT - Proceedings The 2007 International Conference on Intelligent Pervasive Computing, IPC 2007

ER -