The Community for Technology Leaders
Green Image
Existing models for nearest neighbor search in multidimensional spaces are not appropriate for query optimization because they either lead to erroneous estimation or involve complex equations that are expensive to evaluate in real-time. This paper proposes an alternative method that captures the performance of nearest neighbor queries using approximation. For uniform data, our model involves closed formulae that are very efficient to compute and accurate for up to 10 dimensions. Further, the proposed equations can be applied on nonuniform data with the aid of histograms. We demonstrate the effectiveness of the model by using it to solve several optimization problems related to nearest neighbor search.
Information storage and retrieval, selection process.

N. Mamoulis, Y. Tao, J. Zhang and D. Papadias, "An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces," in IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 1169-1184, 2004.
93 ms
(Ver 3.3 (11022016))