|
|
|||||||||||||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree |
---|
Fields in de.lmu.ifi.dbs.elki.index.tree declared as TreeIndex | |
---|---|
private TreeIndex<O,N,E> |
BreadthFirstEnumeration.index
The index storing the nodes. |
Constructors in de.lmu.ifi.dbs.elki.index.tree with parameters of type TreeIndex | |
---|---|
BreadthFirstEnumeration(TreeIndex<O,N,E> index,
TreeIndexPath<E> rootPath)
Creates a new breadth first enumeration with the specified node as root node. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical | |
---|---|
class |
MetricalIndex<O extends DatabaseObject,D extends Distance<D>,N extends MetricalNode<N,E>,E extends MetricalEntry>
Abstract super class for all metrical index classes. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants | |
---|---|
class |
AbstractMTree<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Abstract super class for all M-Tree variants. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees | |
---|---|
class |
AbstractMkTree<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Abstract class for all M-Tree variants supporting processing of reverse k-nearest neighbor queries by using the k-nn distances of the entries, where k is less than or equal to the specified parameter AbstractMkTree.K_MAX_PARAM . |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp | |
---|---|
class |
MkAppTree<O extends DatabaseObject,D extends NumberDistance<D,N>,N extends Number>
MkAppTree is a metrical index structure based on the concepts of the M-Tree supporting efficient processing of reverse k nearest neighbor queries for parameter k < kmax. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop | |
---|---|
class |
MkCoPTree<O extends DatabaseObject,D extends NumberDistance<D,N>,N extends Number>
MkCopTree is a metrical index structure based on the concepts of the M-Tree supporting efficient processing of reverse k nearest neighbor queries for parameter k < kmax. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax | |
---|---|
class |
MkMaxTree<O extends DatabaseObject,D extends Distance<D>>
MkMaxTree is a metrical index structure based on the concepts of the M-Tree supporting efficient processing of reverse k nearest neighbor queries for parameter k <= k_max. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab | |
---|---|
class |
MkTabTree<O extends DatabaseObject,D extends Distance<D>>
MkTabTree is a metrical index structure based on the concepts of the M-Tree supporting efficient processing of reverse k nearest neighbor queries for parameter k < kmax. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree | |
---|---|
class |
MTree<O extends DatabaseObject,D extends Distance<D>>
MTree is a metrical index structure based on the concepts of the M-Tree. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial | |
---|---|
class |
SpatialIndex<O extends NumberVector<O,?>,N extends SpatialNode<N,E>,E extends SpatialEntry>
Abstract super class for all spatial index classes. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants | |
---|---|
class |
AbstractRStarTree<O extends NumberVector<O,?>,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>
Abstract superclass for index structures based on a R*-Tree. |
class |
NonFlatRStarTree<O extends NumberVector<O,?>,N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry>
Abstract superclass for all non-flat R*-Tree variants. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu | |
---|---|
class |
DeLiCluTree<O extends NumberVector<O,?>>
DeLiCluTree is a spatial index structure based on an R-TRee. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rdknn |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rdknn | |
---|---|
class |
RdKNNTree<O extends NumberVector<O,?>,D extends NumberDistance<D,N>,N extends Number>
RDkNNTree is a spatial index structure based on the concepts of the R*-Tree supporting efficient processing of reverse k nearest neighbor queries. |
Uses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar |
---|
Subclasses of TreeIndex in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar | |
---|---|
class |
RStarTree<O extends NumberVector<O,?>>
RStarTree is a spatial index structure based on the concepts of the R*-Tree. |
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |