@Reference(authors="N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger", title="The R*-tree: an efficient and robust access method for points and rectangles", booktitle="Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, May 23-25, 1990", url="http://dx.doi.org/10.1145/93597.98741") public class FarReinsert extends AbstractPartialReinsert
Modifier and Type | Class and Description |
---|---|
static class |
FarReinsert.Parameterizer
Parameterization class.
|
distanceFunction, reinsertAmount
Constructor and Description |
---|
FarReinsert(double reinsertAmount,
SpatialPrimitiveDistanceFunction<?> distanceFunction)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<A> int[] |
computeReinserts(A entries,
ArrayAdapter<? extends SpatialComparable,? super A> getter,
SpatialComparable page)
Perform reinsertions.
|
public FarReinsert(double reinsertAmount, SpatialPrimitiveDistanceFunction<?> distanceFunction)
reinsertAmount
- Amount to reinsertdistanceFunction
- Distance functionpublic <A> int[] computeReinserts(A entries, ArrayAdapter<? extends SpatialComparable,? super A> getter, SpatialComparable page)
ReinsertStrategy
entries
- Entries in overflowing nodegetter
- Adapter for the entries arraypage
- Spatial extend of the pageCopyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.