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
J. Aronson. Information technologies and global politics: The changing scope of power and governance, State University of New York Press, Albany, (2002)
G. Arumugam, M.Thangaraj, и R. Sasirekha. International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), 1, стр. 09-19. ACM, (апреля 2011)