de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split
Class MRadSplit<O,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.split.MTreeSplit<O,D,N,E>
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split.MRadSplit<O,D,N,E>
- Type Parameters:
O
- the type of DatabaseObject to be stored in the M-TreeD
- the type of Distance used in the M-TreeN
- the type of AbstractMTreeNode used in the M-TreeE
- the type of MetricalEntry used in the M-Tree
public class MRadSplit<O,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
- extends MTreeSplit<O,D,N,E>
Encapsulates the required methods for a split of a node in an M-Tree. The
routing objects are chosen according to the M_rad strategy.
Fields inherited from class de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split.MTreeSplit |
assignments |
Method Summary |
private void |
promote(N node,
DistanceQuery<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,
DistanceQuery<O,D> distanceFunction)
- Creates a new split object.
- Parameters:
node
- the node to be splitdistanceFunction
- the distance function
promote
private void promote(N node,
DistanceQuery<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 radiuses is minimum.
- Parameters:
node
- the node to be splitdistanceFunction
- the distance function