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. Bao, G. Xue, X. Wu, Y. Yu, B. Fei, и Z. Su. WWW '07: Proceedings of the 16th international conference on World Wide Web, New York, NY, USA, ACM Press, (2007)
R. Baraglia, и F. Silvestri. WI '04: Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence, 0, стр. 199-205. Los Alamitos, CA, USA, IEEE Computer Society, (2004)
R. Baraglia, и F. Silvestri. WI '04: Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence, стр. 199--205. Washington, DC, USA, IEEE Computer Society, (2004)