
@Reference(authors="Leutenegger, S.T. and Lopez, M.A. and Edgington, J.", title="STR: A simple and efficient algorithm for R-tree packing", booktitle="Proc. 13th International Conference on Data Engineering, 1997", url="http://dx.doi.org/10.1109/ICDE.1997.582015") public class SortTileRecursiveBulkSplit extends AbstractBulkSplit
Leutenegger, S.T. and Lopez, M.A. and Edgington, J.:
STR: A simple and efficient algorithm for R-tree packing
In: Proc. 13th International Conference on Data Engineering, 1997
| Modifier and Type | Class and Description |
|---|---|
private static class |
SortTileRecursiveBulkSplit.Compare<T extends SpatialComparable>
Comparison helper.
|
| Constructor and Description |
|---|
SortTileRecursiveBulkSplit() |
| Modifier and Type | Method and Description |
|---|---|
<T extends SpatialComparable> |
partition(List<T> spatialObjects,
int minEntries,
int maxEntries)
Partitions the specified feature vectors
|
protected <T extends SpatialComparable> |
strPartition(List<T> objs,
int start,
int end,
int depth,
int dims,
int maxEntries,
SortTileRecursiveBulkSplit.Compare<T> c,
List<List<T>> ret)
Recursively partition.
|
chooseBulkSplitPoint, trivialPartitionpublic <T extends SpatialComparable> List<List<T>> partition(List<T> spatialObjects, int minEntries, int maxEntries)
BulkSplitT - actual type we splitspatialObjects - the spatial objects to be partitionedminEntries - the minimum number of entries in a partitionmaxEntries - the maximum number of entries in a partitionprotected <T extends SpatialComparable> void strPartition(List<T> objs, int start, int end, int depth, int dims, int maxEntries, SortTileRecursiveBulkSplit.Compare<T> c, List<List<T>> ret)
T - data typeobjs - Object liststart - Subinterval startend - Subinterval enddepth - Iteration depth (must be less than dimensionality!)dims - Total number of dimensionsmaxEntries - Maximum page sizec - Comparison helperret - Output list