Package | Description |
---|---|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants |
R*-Tree and variants.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu | |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.flat | |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query |
Queries on the R-Tree family of indexes: kNN and range queries.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rdknn | |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar | |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.overflow |
Overflow treatment strategies for R-Trees
|
de.lmu.ifi.dbs.elki.visualization.visualizers.parallel.index |
Visualizers for index structure based on parallel coordinates.
|
de.lmu.ifi.dbs.elki.visualization.visualizers.scatterplot.index |
Visualizers for index structures based on 2D projections.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractRStarTreeFactory<O extends NumberVector,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,I extends AbstractRStarTree<N,E,S> & Index,S extends AbstractRTreeSettings>
Abstract factory for R*-Tree based trees.
|
Modifier and Type | Class and Description |
---|---|
class |
NonFlatRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,S extends AbstractRTreeSettings>
Abstract superclass for all non-flat R*-Tree variants.
|
Modifier and Type | Method and Description |
---|---|
void |
AbstractRStarTreeNode.integrityCheck(AbstractRStarTree<N,E,?> tree)
Tests this node (for debugging purposes).
|
Modifier and Type | Class and Description |
---|---|
class |
DeLiCluTree
DeLiCluTree is a spatial index structure based on an R-Tree.
|
class |
DeLiCluTreeIndex<O extends NumberVector>
The common use of the DeLiClu tree: indexing number vectors.
|
Modifier and Type | Class and Description |
---|---|
class |
FlatRStarTree
FlatRTree is a spatial index structure based on a R*-Tree but with a flat
directory.
|
class |
FlatRStarTreeIndex<O extends NumberVector>
The common use of the flat rstar tree: indexing number vectors.
|
Modifier and Type | Field and Description |
---|---|
protected AbstractRStarTree<?,?,?> |
RStarTreeRangeQuery.tree
The index to use
|
protected AbstractRStarTree<?,?,?> |
RStarTreeKNNQuery.tree
The index to use
|
Modifier and Type | Method and Description |
---|---|
static <O extends SpatialComparable> |
RStarTreeUtil.getKNNQuery(AbstractRStarTree<?,?,?> tree,
SpatialDistanceQuery<O> distanceQuery,
Object... hints)
Get an RTree knn query, using an optimized double implementation when
possible.
|
static <O extends SpatialComparable> |
RStarTreeUtil.getRangeQuery(AbstractRStarTree<?,?,?> tree,
SpatialDistanceQuery<O> distanceQuery,
Object... hints)
Get an RTree range query, using an optimized double implementation when
possible.
|
Constructor and Description |
---|
EuclideanRStarTreeKNNQuery(AbstractRStarTree<?,?,?> tree,
Relation<? extends O> relation)
Constructor.
|
EuclideanRStarTreeRangeQuery(AbstractRStarTree<?,?,?> tree,
Relation<? extends O> relation)
Constructor.
|
RStarTreeKNNQuery(AbstractRStarTree<?,?,?> tree,
Relation<? extends O> relation,
SpatialPrimitiveDistanceFunction<? super O> distanceFunction)
Constructor.
|
RStarTreeRangeQuery(AbstractRStarTree<?,?,?> tree,
Relation<? extends O> relation,
SpatialPrimitiveDistanceFunction<? super O> distanceFunction)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
class |
RdKNNTree<O extends NumberVector>
RDkNNTree is a spatial index structure based on the concepts of the R*-Tree
supporting efficient processing of reverse k nearest neighbor queries.
|
Modifier and Type | Class and Description |
---|---|
class |
RStarTree
RStarTree is a spatial index structure based on the concepts of the R*-Tree.
|
class |
RStarTreeIndex<O extends NumberVector>
The common use of the rstar tree: indexing number vectors.
|
Modifier and Type | Method and Description |
---|---|
<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry> |
SplitOnlyOverflowTreatment.handleOverflow(AbstractRStarTree<N,E,?> tree,
N node,
IndexTreePath<E> path) |
<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry> |
OverflowTreatment.handleOverflow(AbstractRStarTree<N,E,?> tree,
N node,
IndexTreePath<E> path)
Handle overflow in the given node.
|
<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry> |
LimitedReinsertOverflowTreatment.handleOverflow(AbstractRStarTree<N,E,?> tree,
N node,
IndexTreePath<E> path) |
Modifier and Type | Field and Description |
---|---|
protected AbstractRStarTree<N,E,?> |
RTreeParallelVisualization.Instance.tree
The tree we visualize
|
Modifier and Type | Method and Description |
---|---|
private void |
RTreeParallelVisualization.Instance.visualizeRTreeEntry(SVGPlot svgp,
Element layer,
ProjectionParallel proj,
AbstractRStarTree<? extends N,E,?> rtree,
E entry,
int depth,
int step)
Recursively draw the MBR rectangles.
|
Modifier and Type | Field and Description |
---|---|
protected AbstractRStarTree<N,E,?> |
TreeMBRVisualization.Instance.tree
The tree we visualize
|
Modifier and Type | Method and Description |
---|---|
private void |
TreeMBRVisualization.Instance.visualizeRTreeEntry(SVGPlot svgp,
Element layer,
Projection2D proj,
AbstractRStarTree<? extends N,E,?> rtree,
E entry,
int depth)
Recursively draw the MBR rectangles.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.