7 relations: Ball tree, Bounding volume hierarchy, ELKI, List of data structures, Metric tree, R-tree, Spatial database.
Ball tree
In computer science, a ball tree, balltree or metric tree, is a space partitioning data structure for organizing points in a multi-dimensional space.
New!!: M-tree and Ball 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 »
ELKI
ELKI (for Environment for DeveLoping KDD-Applications Supported by Index-Structures) is a knowledge discovery in databases (KDD, "data mining") software framework developed for use in research and teaching originally at the database systems research unit of Professor Hans-Peter Kriegel at the Ludwig Maximilian University of Munich, Germany.
New!!: M-tree and ELKI · See more »
List of data structures
This is a list of data structures.
New!!: M-tree and List of data structures · See more »
Metric tree
A metric tree is any tree data structure specialized to index data in metric spaces.
New!!: M-tree and Metric tree · 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 »
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 »