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
X. Wei, и B. Croft. SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, стр. 178--185. New York, NY, USA, ACM Press, (2006)
G. Weikum. SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, стр. 25--30. New York, NY, USA, ACM Press, (2007)