Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

M-tree

Index M-tree

M-trees are tree data structures that are similar to R-trees and B-trees. [1]

12 relations: B-tree, Bounding volume hierarchy, GiST, Information retrieval, Interval tree, K-nearest neighbors algorithm, Metric (mathematics), R-tree, Segment tree, Spatial database, Tree (data structure), Triangle inequality.

B-tree

In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.

New!!: M-tree and B-tree · See more »

Bounding volume hierarchy

A bounding volume hierarchy (BVH) is a tree structure on a set of geometric objects.

New!!: M-tree and Bounding volume hierarchy · See more »

GiST

In computing, GiST or Generalized Search Tree, is a data structure and API that can be used to build a variety of disk-based search trees.

New!!: M-tree and GiST · See more »

Information retrieval

Information retrieval (IR) is the activity of obtaining information system resources relevant to an information need from a collection of information resources.

New!!: M-tree and Information retrieval · See more »

Interval tree

In computer science, an interval tree is a tree data structure to hold intervals.

New!!: M-tree and Interval tree · See more »

K-nearest neighbors algorithm

In pattern recognition, the k-nearest neighbors algorithm (k-NN) is a non-parametric method used for classification and regression.

New!!: M-tree and K-nearest neighbors algorithm · See more »

Metric (mathematics)

In mathematics, a metric or distance function is a function that defines a distance between each pair of elements of a set.

New!!: M-tree and Metric (mathematics) · See more »

R-tree

R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons.

New!!: M-tree and R-tree · See more »

Segment tree

In computer science, a segment tree also known as a statistic tree is a tree data structure used for storing information about intervals, or segments.

New!!: M-tree and Segment tree · See more »

Spatial database

A spatial database is a database that is optimized for storing and querying data that represents objects defined in a geometric space.

New!!: M-tree and Spatial database · See more »

Tree (data structure)

In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.

New!!: M-tree and Tree (data structure) · See more »

Triangle inequality

In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side.

New!!: M-tree and Triangle inequality · See more »

References

[1] https://en.wikipedia.org/wiki/M-tree

OutgoingIncoming
Hey! We are on Facebook now! »