Package | Description |
---|---|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.strategies.split |
Splitting strategies of nodes in an M-Tree (and variants).
|
Modifier and Type | Method and Description |
---|---|
(package private) Assignments<E> |
MTreeSplit.balancedPartition(AbstractMTree<O,N,E,?> tree,
N node,
DBID routingObject1,
DBID routingObject2)
Creates a balanced partition of the entries of the specified node.
|
(package private) Assignments<E> |
MTreeSplit.balancedPartition(AbstractMTree<O,N,E,?> tree,
N node,
int routingEntNum1,
int routingEntNum2,
double[] distanceMatrix)
Creates a balanced partition of the entries of the specified node.
|
Assignments<E> |
RandomSplit.split(AbstractMTree<O,N,E,?> tree,
N node)
Selects two objects of the specified node to be promoted and stored into
the parent node.
|
abstract Assignments<E> |
MTreeSplit.split(AbstractMTree<O,N,E,?> tree,
N node)
Returns the assignments of this split.
|
Assignments<E> |
MRadSplit.split(AbstractMTree<O,N,E,?> tree,
N node)
Selects two objects of the specified node to be promoted and stored into
the parent node.
|
Assignments<E> |
MMRadSplit.split(AbstractMTree<O,N,E,?> tree,
N node)
Selects two objects of the specified node to be promoted and stored into
the parent node.
|
Assignments<E> |
MLBDistSplit.split(AbstractMTree<O,N,E,?> tree,
N node)
Selects the second object of the specified node to be promoted and stored
into the parent node and partitions the entries according to the M_LB_DIST
strategy.
|
Modifier and Type | Method and Description |
---|---|
private int |
MTreeSplit.assignBest(Assignments<E> assign,
long[] assigned,
N node,
double[] dis,
int[] idx,
int pos,
boolean second)
Assigns the first object of the specified list to the first assignment that
it is not yet assigned to the second assignment.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.