Singular value decomposition 기반 고차원 인덱스 구조

A High-Dimensional Index Structure Based on Singular Value Decomposition

The nearest neighbor query is an important operation widely used in multimedia databases for finding the object that is most similar to a given query object. Most of techniques for processing nearest neighbor queries employ multidimensional indexes for effective indexing of objects. However, the performance of previous multidimensional indexes, which use N-dimensional rectangles or spheres for representing the capsule of the object cluster, deteriorates seriously as the number of dimensions gets higher. This problem and the query processing method using it. We also verify the superiority of our approach through performance evaluation by performing extensive experiments.