All Classes Interface Summary Class Summary
| Class |
Description |
| AbstractBulkSplit |
Encapsulates the required parameters for a bulk split of a spatial index.
|
| AbstractPartialReinsert |
Abstract base class for reinsertion strategies that have a "relative amount"
parameter to partially reinsert entries.
|
| AbstractPartialReinsert.Par |
Parameterization class.
|
| AbstractRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,S extends RTreeSettings> |
Abstract superclass for index structures based on a R*-Tree.
|
| AbstractRStarTreeFactory<O extends elki.data.NumberVector,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,S extends RTreeSettings> |
Abstract factory for R*-Tree based trees.
|
| AbstractRStarTreeNode<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry> |
Abstract superclass for nodes in a R*-Tree.
|
| AdaptiveSortTileRecursiveBulkSplit |
This is variation of the original STR bulk load for non-rectangular data
spaces.
|
| AdaptiveSortTileRecursiveBulkSplit.Par |
Parameterization class.
|
| AngTanLinearSplit |
Line-time complexity split proposed by Ang and Tan.
|
| AngTanLinearSplit.Par |
Parameterization class.
|
| ApproximativeLeastOverlapInsertionStrategy |
The choose subtree method proposed by the R*-Tree with slightly better
performance for large leaf sizes (linear approximation).
|
| ApproximativeLeastOverlapInsertionStrategy.Par |
Parameterization class.
|
| BulkSplit |
Interface for a bulk split strategy.
|
| CloseReinsert |
Reinsert objects on page overflow, starting with close objects first (even
when they will likely be inserted into the same page again!)
|
| CloseReinsert.Par |
Parameterization class.
|
| CombinedInsertionStrategy |
Use two different insertion strategies for directory and leaf nodes.
|
| CombinedInsertionStrategy.Par |
Parameterization class.
|
| DeLiCluDirectoryEntry |
Defines the requirements for a directory entry in an DeLiClu-Tree node.
|
| DeLiCluEntry |
Defines the requirements for an entry in an DeLiClu-Tree node.
|
| DeLiCluLeafEntry |
Defines the requirements for a leaf entry in an DeLiClu-Tree node.
|
| DeLiCluNode |
Represents a node in a DeLiClu-Tree.
|
| DeLiCluTree |
DeLiCluTree is a spatial index structure based on an R-Tree.
|
| DeLiCluTreeFactory<O extends elki.data.NumberVector> |
Factory for DeLiClu R*-Trees.
|
| DeLiCluTreeFactory.Par<O extends elki.data.NumberVector> |
Parameterization class.
|
| DeLiCluTreeIndex<O extends elki.data.NumberVector> |
The common use of the DeLiClu tree: indexing number vectors.
|
| EuclideanRStarTreeDistancePrioritySearcher<O extends elki.data.spatial.SpatialComparable> |
Instance of priority search for a particular spatial index.
|
| EuclideanRStarTreeKNNQuery<O extends elki.data.NumberVector> |
Instance of a KNN query for a particular spatial index.
|
| EuclideanRStarTreeRangeQuery<O extends elki.data.NumberVector> |
Instance of a range query for a particular spatial index.
|
| FarReinsert |
Reinsert objects on page overflow, starting with farther objects first (even
when they will likely be inserted into the same page again!)
|
| FarReinsert.Par |
Parameterization class.
|
| FileOrderBulkSplit |
Trivial bulk loading - assumes that the file has been appropriately sorted
before.
|
| FileOrderBulkSplit.Par |
Parameterization class.
|
| FlatRStarTree |
FlatRTree is a spatial index structure based on a R*-Tree but with a flat
directory.
|
| FlatRStarTreeFactory<O extends elki.data.NumberVector> |
Factory for flat R*-Trees.
|
| FlatRStarTreeFactory.Par<O extends elki.data.NumberVector> |
Parameterization class.
|
| FlatRStarTreeIndex<O extends elki.data.NumberVector> |
The common use of the flat rstar tree: indexing number vectors.
|
| FlatRStarTreeNode |
Represents a node in a flat R*-Tree.
|
| GreeneSplit |
Quadratic-time complexity split as used by Diane Greene for the R-Tree.
|
| GreeneSplit.Par |
Parameterization class.
|
| InsertionStrategy |
RTree insertion strategy interface.
|
| LeastEnlargementInsertionStrategy |
The default R-Tree insertion strategy: find rectangle with least volume
enlargement.
|
| LeastEnlargementInsertionStrategy.Par |
Parameterization class.
|
| LeastEnlargementWithAreaInsertionStrategy |
A slight modification of the default R-Tree insertion strategy: find
rectangle with least volume enlargement, but choose least area on ties.
|
| LeastEnlargementWithAreaInsertionStrategy.Par |
Parameterization class.
|
| LeastOverlapInsertionStrategy |
The choose subtree method proposed by the R*-Tree for leaf nodes.
|
| LeastOverlapInsertionStrategy.Par |
Parameterization class.
|
| LimitedReinsertOverflowTreatment |
Limited reinsertions, as proposed by the R*-Tree: For each real insert, allow
reinsertions to happen only once per level.
|
| LimitedReinsertOverflowTreatment.Par |
Parameterization class.
|
| MaxExtensionBulkSplit |
Split strategy for bulk-loading a spatial tree where the split axes are the
dimensions with maximum extension.
|
| MaxExtensionBulkSplit.Par |
Parameterization class.
|
| MaxExtensionSortTileRecursiveBulkSplit |
|
| MaxExtensionSortTileRecursiveBulkSplit.Par |
Parameterization class.
|
| NodeArrayAdapter |
Access the entries of a node as array-like.
|
| NonFlatRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,S extends RTreeSettings> |
Abstract superclass for all non-flat R*-Tree variants.
|
| OneDimSortBulkSplit |
Simple bulk loading strategy by sorting the data along the first dimension.
|
| OneDimSortBulkSplit.Par |
Parameterization class.
|
| OverflowTreatment |
Reinsertion strategy to resolve overflows in the R*-tree.
|
| RdKNNDirectoryEntry |
Represents an entry in a directory node of an RdKNN-Tree.
|
| RdKNNEntry |
Defines the requirements for an entry in an RdKNN-Tree node.
|
| RdKNNLeafEntry |
Represents an entry in a leaf node of an RdKNN-Tree.
|
| RdKNNNode |
Represents a node in a RDkNN-Tree.
|
| RdkNNSettings |
Settings for the RdKNN Tree.
|
| RdKNNTree<O extends elki.data.NumberVector> |
RDkNNTree is a spatial index structure based on the concepts of the R*-Tree
supporting efficient processing of reverse k nearest neighbor queries.
|
| RdKNNTreeFactory<O extends elki.data.NumberVector> |
Factory for RdKNN R*-Trees.
|
| RdKNNTreeFactory.Par<O extends elki.data.NumberVector> |
Parameterization class.
|
| RdKNNTreeHeader |
Encapsulates the header information of a RDkNN-Tree.
|
| ReinsertStrategy |
Reinsertion strategy to resolve overflows in the RStarTree.
|
| RStarTree |
RStarTree is a spatial index structure based on the concepts of the R*-Tree.
|
| RStarTreeDistancePrioritySearcher<O extends elki.data.spatial.SpatialComparable> |
Instance of priority search for a particular spatial index.
|
| RStarTreeFactory<O extends elki.data.NumberVector> |
Factory for regular R*-Trees.
|
| RStarTreeIndex<O extends elki.data.NumberVector> |
The common use of the rstar tree: indexing number vectors.
|
| RStarTreeKNNSearcher<O extends elki.data.spatial.SpatialComparable> |
Instance of a KNN query for a particular spatial index.
|
| RStarTreeNode |
Represents a node in an R*-Tree.
|
| RStarTreeRangeSearcher<O extends elki.data.spatial.SpatialComparable> |
Instance of a range query for a particular spatial index.
|
| RStarTreeUtil |
Utility class for RStar trees.
|
| RTreeLinearSplit |
Linear-time complexity greedy split as used by the original R-Tree.
|
| RTreeLinearSplit.Par |
Parameterization class.
|
| RTreeQuadraticSplit |
Quadratic-time complexity greedy split as used by the original R-Tree.
|
| RTreeQuadraticSplit.Par |
Parameterization class.
|
| RTreeSettings |
Class to wrap common Rtree settings.
|
| SortTileRecursiveBulkSplit |
Sort-Tile-Recursive aims at tiling the data space with a grid-like structure
for partitioning the dataset into the required number of buckets.
|
| SortTileRecursiveBulkSplit.Par |
Parameterization class.
|
| SpatialApproximationMaterializeKNNPreprocessor<O extends elki.data.NumberVector> |
A preprocessor for annotation of the k nearest neighbors (and their
distances) to each database object.
|
| SpatialApproximationMaterializeKNNPreprocessor.Factory |
The actual preprocessor instance.
|
| SpatialApproximationMaterializeKNNPreprocessor.Factory.Par |
Parameterization class.
|
| SpatialDirectoryEntry |
Represents an entry in a directory node of a spatial index.
|
| SpatialEntry |
Defines the requirements for an entry in a node of a spatial index.
|
| SpatialPointLeafEntry |
Represents an entry in a leaf node of a spatial index.
|
| SpatialSortBulkSplit |
Bulk loading by spatially sorting the objects, then partitioning the sorted
list appropriately.
|
| SpatialSortBulkSplit.Par |
Parametization class
|
| SplitOnlyOverflowTreatment |
Always split, as in the original R-Tree
|
| SplitOnlyOverflowTreatment.Par |
Parameterization class.
|
| SplitStrategy |
Generic interface for split strategies.
|
| TopologicalSplitter |
Encapsulates the required parameters for a topological split of a R*-Tree.
|
| TopologicalSplitter.Par |
Parameterization class.
|
| TopologicalSplitter.Split<A,E extends elki.data.spatial.SpatialComparable> |
Internal data for an actual split.
|