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
M. Sanderson. Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval, Seite 142--151. New York, NY, USA, Springer-Verlag New York, Inc., (1994)
G. Gottlob, G. Orsi, und A. Pieris. (2011)cite arxiv:1112.0343Comment: Extended version of "Ontological Queries: Rewriting and Optimization" presented at ICDE 2011.
K. Lang. Proceedings of the 12th International Conference on Machine Learning, Seite 331--339. Morgan Kaufmann publishers Inc.: San Mateo, CA, USA, (1995)
K. Lang. Proceedings of the 12th International Conference on Machine Learning, Seite 331--339. Morgan Kaufmann publishers Inc.: San Mateo, CA, USA, (1995)
R. Cole, P. Eklund, und B. Groh. International Symposium on Knowledge Retrieval, Use, and Storage for Efficiency, KRUSE-97, Seite 151-164. (1997)Later revised and published completely in Cole's Computational Intelligence paper.
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)