de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants
Class MRadSplit<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
java.lang.Object
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.MTreeSplit<O,D,N,E>
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.MRadSplit<O,D,N,E>
public class MRadSplit<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
- extends MTreeSplit<O,D,N,E>
Encapsulates the required parameters for a split of a node in an M-Tree. The
routing objects are chosen according to the M_rad strategy.
- Author:
- Elke Achtert
Method Summary |
private void |
promote(N node,
DistanceFunction<O,D> distanceFunction)
Selects two objects of the specified node to be promoted and stored into
the parent node. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
MRadSplit
public MRadSplit(N node,
DistanceFunction<O,D> distanceFunction)
- Creates a new split object.
- Parameters:
node
- the node to be splitteddistanceFunction
- the distance function
promote
private void promote(N node,
DistanceFunction<O,D> distanceFunction)
- Selects two objects of the specified node to be promoted and stored into
the parent node. The m-RAD strategy considers all possible pairs of
objects and, after partitioning the set of entries, promotes the pair of
objects for which the sum of covering radii is minimum.
- Parameters:
node
- the node to be splitteddistanceFunction
- the distance function