Skip to Main Content
Because of the intense bounding and the distance of the query vector to the cluster bounding is closer to the true distance, filtering out irrelevant clusters by the distance of the query vector to the cluster bounding in the process of similarity search has well reduced the I/O complexity. Hence, the "curse of dimensionality" can be well avoided. We propose an improved KNN search algorithm based on adaptive cluster distance bounding for high dimensional indexing by reducing the CPU cost which was achieved by filtering out unnecessary distance calculations number using the triangle inequality, but with the cost of some overhead and pretreatment. Finally, we verify the improved exact KNN search algorithm has a better performance through some experiments based on a real data set.