M-tree entry distribution strategies.
|Assignments<E extends MTreeEntry>||
Encapsulates the attributes of an assignment during a split.
Balanced entry distribution strategy of the M-tree.
|DistanceEntry<E extends Entry>||
Helper class: encapsulates an entry in an Index and a distance value belonging to this entry.
Balanced entry distribution strategy of the M-tree, beginning with the most difficult points first.
Generalized hyperplane entry distribution strategy of the M-tree.
Copyright © 2019 ELKI Development Team. License information.