@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 GeneralizedHyperplaneDistribution extends java.lang.Object implements DistributionStrategy
This strategy does not produce balanced trees, but often produces faster access times, according to the original publication.
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)
Constructor and Description |
---|
GeneralizedHyperplaneDistribution() |
Modifier and Type | Method and Description |
---|---|
<E extends MTreeEntry> |
distribute(AbstractNode<E> node,
int routing1,
double[] dis1,
int routing2,
double[] dis2)
Creates a balanced partition of the entries of the specified node.
|
public <E extends MTreeEntry> Assignments<E> distribute(AbstractNode<E> node, int routing1, double[] dis1, int routing2, double[] dis2)
DistributionStrategy
distribute
in interface DistributionStrategy
E
- entry typenode
- the node to be splitrouting1
- the entry number of the first routing objectdis1
- Distances from first routing objectrouting2
- the entry number of the second routing objectdis2
- Distances from second routing objectCopyright © 2019 ELKI Development Team. License information.