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. Proceedings of the 3rd European Semantic Web Conference, volume 4011 of LNCS, page 411-426. Budva, Montenegro, Springer, (June 2006)
D. Palacio, G. Cabanac, C. Sallaberry, and G. Hubert. Research and Advanced Technology for Digital Libraries, volume 6273 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 10.1007/978-3-642-15464-5\_34.(2010)
A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. Proceedings of the 3rd European Semantic Web Conference, page 411-426. Budva, Montenegro, Springer, (June 2006)
D. Puppin, and F. Silvestri. CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management, page 880--881. New York, NY, USA, ACM, (2006)