The M-tree is an index structure that can be used for the efficient resolution of similarity queries on complex objects to be compared using an arbitrary metric, i.e. a distance function d that satisfies the positivity, symmetry, and triangle inequality p
S. Wong, W. Ziarko, и P. Wong. SIGIR '85: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, стр. 18--25. New York, NY, USA, ACM Press, (1985)