Fast Nearest Neighbor Search in High-Dimensional Spaces
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearest-neighbor search which corresponds to a computation of the voronoi cell of each data point. In a second step, we store the voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precomputation of the solution space, it is dynamic, i.e. it supports insertions of new data points. An extensive experimental evaluation of our technique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in the X-tree (up to a factor of 4).
|Authors:||Berchtold S., Ertl B., Keim D. A., Kriegel H.-P., Seidl T.|
|Published in:||Proc. IEEE 14th Int. Conf. on Data Engineering (ICDE 1998), Orlando, Florida|
|Type:||Conference papers (peer reviewed)|
|Research topic:||Exploration of Multimedia Databases|