@article{ART001175875},
author={Byung-Gon Kim and OH Sung-Kyun},
title={K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2005},
volume={10},
number={1},
pages={85-91}
TY - JOUR
AU - Byung-Gon Kim
AU - OH Sung-Kyun
TI - K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures
JO - Journal of The Korea Society of Computer and Information
PY - 2005
VL - 10
IS - 1
PB - The Korean Society Of Computer And Information
SP - 85
EP - 91
SN - 1598-849X
AB - Recently, query processing techniques for the multi-dimensional data like images have been widely used to perform content-based retrieval of the data. Range Quesy and Nearest neighbor query are widly used multi dimensional queries. This paper proposes the efficient pruning strategies for k-nearest neighbor query in R-tree variants indexing structures. Pruning strategy is important for the multi-dimensional indexing query processing so that search space can be reduced. We analyzed the pruning strategies and perform experiments to show overhead and the profit of the strategies. Finally, we propose best use of the strategies.
KW - k-Nearest neighbor query;Multi-dimnesional indexing;R-tree;Pruning
DO -
UR -
ER -
Byung-Gon Kim and OH Sung-Kyun. (2005). K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures. Journal of The Korea Society of Computer and Information, 10(1), 85-91.
Byung-Gon Kim and OH Sung-Kyun. 2005, "K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures", Journal of The Korea Society of Computer and Information, vol.10, no.1 pp.85-91.
Byung-Gon Kim, OH Sung-Kyun "K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures" Journal of The Korea Society of Computer and Information 10.1 pp.85-91 (2005) : 85.
Byung-Gon Kim, OH Sung-Kyun. K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures. 2005; 10(1), 85-91.
Byung-Gon Kim and OH Sung-Kyun. "K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures" Journal of The Korea Society of Computer and Information 10, no.1 (2005) : 85-91.
Byung-Gon Kim; OH Sung-Kyun. K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures. Journal of The Korea Society of Computer and Information, 10(1), 85-91.
Byung-Gon Kim; OH Sung-Kyun. K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures. Journal of The Korea Society of Computer and Information. 2005; 10(1) 85-91.
Byung-Gon Kim, OH Sung-Kyun. K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures. 2005; 10(1), 85-91.
Byung-Gon Kim and OH Sung-Kyun. "K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures" Journal of The Korea Society of Computer and Information 10, no.1 (2005) : 85-91.
