Uses of Class
de.lmu.ifi.dbs.elki.index.tree.IndexTree

Packages that use IndexTree

Package	Description
de.lmu.ifi.dbs.elki.index.tree	Tree-based index structures
de.lmu.ifi.dbs.elki.index.tree.metrical	Tree-based index structures for metrical vector spaces.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants	M-Tree and variants.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees	Metrical index structures based on the concepts of the M-Tree supporting processing of reverse k nearest neighbor queries by using the k-nn distances of the entries.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp	MkAppTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop	MkCoPTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax	MkMaxTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab	MkTabTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree	MTree
de.lmu.ifi.dbs.elki.index.tree.spatial	Tree-based index structures for spatial indexing.
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants	R*-Tree and variants.
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu	DeLiCluTree
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar	RStarTree

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree

Fields in de.lmu.ifi.dbs.elki.index.tree declared as IndexTree

Modifier and Type	Field and Description
private IndexTree<N,E>	BreadthFirstEnumeration.index The index storing the nodes.

Constructors in de.lmu.ifi.dbs.elki.index.tree with parameters of type IndexTree

Constructor and Description
BreadthFirstEnumeration(IndexTree<N,E> index, IndexTreePath<E> rootPath) Creates a new breadth first enumeration with the specified node as root node.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical

Modifier and Type	Class and Description
class	MetricalIndexTree<O,D extends Distance<D>,N extends Node<E>,E extends Entry> Abstract super class for all metrical index classes.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants

Modifier and Type	Class and Description
class	AbstractMTree<O,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 IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees

Modifier and Type	Class and Description
class	AbstractMkTree<O,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 given parameter.
class	AbstractMkTreeUnified<O,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 given parameter.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp

Modifier and Type	Class and Description
class	MkAppTree<O,D extends NumberDistance<D,?>> 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.
class	MkAppTreeIndex<O,D extends NumberDistance<D,?>> MkAppTree used as database index.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop

Modifier and Type	Class and Description
class	MkCoPTree<O,D extends NumberDistance<D,?>> 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.
class	MkCoPTreeIndex<O,D extends NumberDistance<D,?>> MkCoPTree used as database index.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax

Modifier and Type	Class and Description
class	MkMaxTree<O,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.
class	MkMaxTreeIndex<O,D extends Distance<D>>

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab

Modifier and Type	Class and Description
class	MkTabTree<O,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.
class	MkTabTreeIndex<O,D extends Distance<D>> MkTabTree used as database index.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree

Modifier and Type	Class and Description
class	MTree<O,D extends Distance<D>> MTree is a metrical index structure based on the concepts of the M-Tree.
class	MTreeIndex<O,D extends Distance<D>> Class for using an m-tree as database index.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial

Modifier and Type	Class and Description
class	SpatialIndexTree<N extends SpatialNode<N,E>,E extends SpatialEntry> Abstract super class for all spatial index tree classes.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants

Modifier and Type	Class and Description
class	AbstractRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry> Abstract superclass for index structures based on a R*-Tree.
class	NonFlatRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry> Abstract superclass for all non-flat R*-Tree variants.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu

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.

Uses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar

Subclasses of IndexTree in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar

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.