Uses of Class
de.lmu.ifi.dbs.elki.index.tree.metrical.MetricalIndexTree

Packages that use MetricalIndexTree

de.lmu.ifi.dbs.elki.index.preprocessed.knn	Indexes providing KNN and rKNN data.
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

Uses of MetricalIndexTree in de.lmu.ifi.dbs.elki.index.preprocessed.knn

Methods in de.lmu.ifi.dbs.elki.index.preprocessed.knn that return MetricalIndexTree

private MetricalIndexTree<O,D,N,E>

MetricalIndexApproximationMaterializeKNNPreprocessor.getMetricalIndex(Relation<O> relation) Do some (limited) type checking, then cast the database into a spatial database.

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

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

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 MetricalIndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees

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

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 MetricalIndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp

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

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 MetricalIndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop

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

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 MetricalIndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax

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

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 MetricalIndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab

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

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 MetricalIndexTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree

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

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.