E
- the type of MTreeEntry used in the M-TreeN
- the type of AbstractMTreeNode used in the M-Tree@Reference(authors="P. Ciaccia, M. Patella, P. Zezula", title="M-tree: An Efficient Access Method for Similarity Search in Metric Spaces", booktitle="Proc. Int. Conf. Very Large Data Bases (VLDB\'97)", url="http://www.vldb.org/conf/1997/P426.PDF", bibkey="DBLP:conf/vldb/CiacciaPZ97") public class RandomSplit<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>> extends AbstractMTreeSplit<E,N>
Note: only the routing objects are chosen at random, this is not a random assignment!
Reference:
P. Ciaccia, M. Patella, P. Zezula
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
In Proc. Int. Conf. Very Large Data Bases (VLDB'97)
Modifier and Type | Class and Description |
---|---|
static class |
RandomSplit.Parameterizer<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
Parameterization class.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Random |
random
Random generator.
|
distributor
Constructor and Description |
---|
RandomSplit(DistributionStrategy distributor,
RandomFactory rnd)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
Assignments<E> |
split(AbstractMTree<?,N,E,?> tree,
N node)
Selects two objects of the specified node to be promoted and stored into
the parent node.
|
computeDistanceMatrix
public RandomSplit(DistributionStrategy distributor, RandomFactory rnd)
distributor
- Distribution strategyrnd
- Random generatorpublic Assignments<E> split(AbstractMTree<?,N,E,?> tree, N node)
tree
- Tree to usenode
- the node to be splitCopyright © 2019 ELKI Development Team. License information.