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
A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. The Semantic Web: Research and Applications, volume 4011 of LNAI, page 411-426. Heidelberg, Springer, (2006)
Q. Zhao, S. Hoi, T. Liu, S. Bhowmick, M. Lyu, and W. Ma. WWW '06: Proceedings of the 15th international conference on World Wide Web, page 543--552. New York, NY, USA, ACM Press, (2006)
K. Sugiyama, K. Hatano, and M. Yoshikawa. WWW '04: Proceedings of the 13th international conference on World Wide Web, page 675--684. New York, NY, USA, ACM Press, (2004)