Package elki.index.tree.spatial.rstarvariants.strategies.bulk

Class AbstractBulkSplit

java.lang.Object

elki.index.tree.spatial.rstarvariants.strategies.bulk.AbstractBulkSplit

All Implemented Interfaces:

BulkSplit

Direct Known Subclasses:

AdaptiveSortTileRecursiveBulkSplit, FileOrderBulkSplit, MaxExtensionBulkSplit, MaxExtensionSortTileRecursiveBulkSplit, OneDimSortBulkSplit, SortTileRecursiveBulkSplit, SpatialSortBulkSplit

public abstract class AbstractBulkSplit
extends java.lang.Object
implements BulkSplit

Encapsulates the required parameters for a bulk split of a spatial index.

Since:

0.4.0

Author:

Elke Achtert

Constructor Summary

Constructors

Constructor	Description
AbstractBulkSplit()	Constructor

Method Summary

Modifier and Type	Method	Description
protected int	chooseBulkSplitPoint(int numEntries, int minEntries, int maxEntries)	Computes and returns the best split point.
protected <T> java.util.List<java.util.List<T>>	trivialPartition(java.util.List<T> objects, int minEntries, int maxEntries)	Perform the trivial partitioning of the given list.

Methods inherited from class java.lang.Object

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

Methods inherited from interface elki.index.tree.spatial.rstarvariants.strategies.bulk.BulkSplit

partition

Constructor Detail

AbstractBulkSplit

public AbstractBulkSplit()

Constructor

Method Detail

chooseBulkSplitPoint

protected int chooseBulkSplitPoint(int numEntries,
                                   int minEntries,
                                   int maxEntries)

Computes and returns the best split point.

Parameters:

numEntries - the number of entries to be split

minEntries - the number of minimum entries in the node to be split

maxEntries - number of maximum entries in the node to be split

Returns:

the best split point

trivialPartition

protected <T> java.util.List<java.util.List<T>> trivialPartition(java.util.List<T> objects,
                                                                 int minEntries,
                                                                 int maxEntries)

Perform the trivial partitioning of the given list.

Parameters:

objects - Objects to partition

minEntries - Minimum number of objects per page

maxEntries - Maximum number of objects per page.

Returns:

List with partitions