de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert

Class ApproximativeLeastOverlapInsertionStrategy

java.lang.Object

de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.LeastOverlapInsertionStrategy

de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.ApproximativeLeastOverlapInsertionStrategy

All Implemented Interfaces:

InsertionStrategy, InspectionUtilFrequentlyScanned, Parameterizable

@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 ApproximativeLeastOverlapInsertionStrategy
extends LeastOverlapInsertionStrategy

The choose subtree method proposed by the R*-Tree with slightly better performance for large leaf sizes (linear approximation).

N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger:
The R*-tree: an efficient and robust access method for points and rectangles
in: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, May 23-25, 1990

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	ApproximativeLeastOverlapInsertionStrategy.Parameterizer Parameterization class.

Field Summary

Fields

Modifier and Type	Field and Description
private int	numCandidates Number of candidates to consider

Fields inherited from class de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.insert.LeastOverlapInsertionStrategy

STATIC

Constructor Summary

Constructors

Constructor and Description
ApproximativeLeastOverlapInsertionStrategy(int candidates) Constructor.

Method Summary

Methods

Modifier and Type	Method and Description
<A> int	choose(A options, ArrayAdapter<? extends SpatialComparable,A> getter, SpatialComparable obj, int height, int depth) Choose insertion rectangle.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

numCandidates

private int numCandidates

Number of candidates to consider

Constructor Detail

ApproximativeLeastOverlapInsertionStrategy

public ApproximativeLeastOverlapInsertionStrategy(int candidates)

Constructor.

Method Detail

choose

public <A> int choose(A options,
             ArrayAdapter<? extends SpatialComparable,A> getter,
             SpatialComparable obj,
             int height,
             int depth)

Description copied from interface: InsertionStrategy

Choose insertion rectangle.

Specified by:

choose in interface InsertionStrategy

Overrides:

choose in class LeastOverlapInsertionStrategy

Parameters:

options - Options to choose from

getter - Array adapter for options

obj - Insertion object

height - Tree height

depth - Insertion depth (depth == height - 1 indicates leaf level)

Returns:

Subtree index in array.