ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Distributed High Dimensional Indexing for K-NN Search
Cited 1 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Hyun-Hwa Choi, Mi-Young Lee, Kyu-Chul Lee
Issue Date
2012-11
Citation
Journal of Supercomputing, v.62, no.3, pp.1362-1384
ISSN
0920-8542
Publisher
Springer
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.1007/s11227-012-0800-z
Abstract
Although conventional index structures provide various nearest-neighbor search algorithms for high-dimensional data, there are additional requirements to increase search performances, as well as to support index scalability for large-scale datasets. To support these requirements, we propose a distributed high-dimensional index structure based on cluster systems, called a Distributed Vector Approximationtree (DVA-tree), which is a two-level structure consisting of a hybrid spill-tree and Vector Approximation files (VA-files). We also describe the algorithms used for constructing the DVA-tree over multiple machines and performing distributed k-nearest neighbors (NN) searches. To evaluate performances of the DVA-tree, we conduct an experimental study using both real and synthetic datasets. The results show that our proposed method has significant performance advantages over existing index structures on different kinds of dataset. © Springer Science+Business Media, LLC 2012.
KSP Keywords
An experimental study, Cluster system, High-Dimensional Data, High-dimensional index structure, Large-scale datasets, Level structure, Neighbor Search, Search Algorithm(GSA), Synthetic Datasets, Two-level, high dimensional indexing