M-tree
id:
m-tree-193-17388869
title:
M-tree
text:
In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle inequality for efficient range and k-nearest neighbor (k-NN) queries.
While M-trees can perform well in many conditions, the tree can also have large overlap and there is no clear strategy on how to best avoid overlap. In addition, it can only be used for distance functions that satisfy the triangle inequality, while many advanced dissimilarit
brand slug:
wiki
category slug:
encyclopedia
description:
Tree data structure
original url:
https://en.wikipedia.org/wiki/M-tree
date created:
date modified:
2023-10-31T08:42:12Z
main entity:
{"identifier":"Q3841143","url":"https://www.wikidata.org/entity/Q3841143"}
image:
fields total:
13
integrity:
14