@Reference(authors="C. H. Ang and T. C. Tan", title="New linear node splitting algorithm for R-trees", booktitle="Proceedings of the 5th International Symposium on Advances in Spatial Databases", url="http://dx.doi.org/10.1007/3-540-63238-7_38") public class AngTanLinearSplit extends Object implements SplitStrategy
C. H. Ang and T. C. Tan:
New linear node splitting algorithm for R-trees
In: Proceedings of the 5th International Symposium on Advances in Spatial
Databases
Modifier and Type | Class and Description |
---|---|
static class |
AngTanLinearSplit.Parameterizer
Parameterization class.
|
Modifier and Type | Field and Description |
---|---|
private static Logging |
logger
Logger class
|
static AngTanLinearSplit |
STATIC
Static instance.
|
Constructor and Description |
---|
AngTanLinearSplit() |
Modifier and Type | Method and Description |
---|---|
protected <E extends SpatialComparable,A> |
computeOverlap(A entries,
ArrayAdapter<E,A> getter,
BitSet assign)
Compute overlap of assignment
|
<E extends SpatialComparable,A> |
split(A entries,
ArrayAdapter<E,A> getter,
int minEntries)
Split a page
|
private static final Logging logger
public static final AngTanLinearSplit STATIC
public <E extends SpatialComparable,A> BitSet split(A entries, ArrayAdapter<E,A> getter, int minEntries)
SplitStrategy
split
in interface SplitStrategy
entries
- Entries to splitgetter
- Adapter for the entries arrayminEntries
- Minimum number of entries in each partprotected <E extends SpatialComparable,A> double computeOverlap(A entries, ArrayAdapter<E,A> getter, BitSet assign)
entries
- Entriesgetter
- Entry accessorassign
- Assignment