M tree

from Wikipedia, the free encyclopedia

M-trees are index structures similar to R-trees , in which data points that are close together can be searched efficiently.

In this case (in contrast to an R-tree) one metric, i.e. H. worked with multi-dimensional spheres for indexing.

M tree

credentials

  1. ↑ Ciaccia, Paolo. Patella, Marco. Zezula, Pavel .: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces . 1997 ( worldcat.org [accessed June 30, 2020]).