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
E. Yilmaz, und J. Aslam. CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management, Seite 102--111. New York, NY, USA, ACM, (2006)
M. Zacher. Information technologies and global politics: The changing scope of power and governance, State University of New York Press, Albany, (2002)
L. Zhang, Q. Liu, J. Zhang, H. Wang, Y. Pan, und Y. Yu. Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea, Volume 4825 von LNCS, Seite 645--658. Berlin, Heidelberg, Springer Verlag, (November 2007)
Q. Zhao, S. Hoi, T. Liu, S. Bhowmick, M. Lyu, und W. Ma. WWW '06: Proceedings of the 15th international conference on World Wide Web, Seite 543--552. New York, NY, USA, ACM Press, (2006)
Y. Zhou, und W. Croft. Proceedings of the 14th ACM International Conference on Information and Knowledge Management, Seite 331--332. New York, NY, USA, ACM, (2005)