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

Packages that use AbstractMTree

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.metrical.mtreevariants.query	Classes for performing queries (knn, range, ...) on metrical trees.
de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d	Visualizers based on 2D projections.

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

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants with type parameters of type AbstractMTree

class

AbstractMTreeFactory<O,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>,I extends AbstractMTree<O,D,N,E> & Index> Abstract factory for various MTrees

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants with parameters of type AbstractMTree

void	AbstractMTreeNode.adjustEntry(E entry, DBID routingObjectID, D parentDistance, AbstractMTree<O,D,N,E> mTree) Adjusts the parameters of the entry representing this node (e.g. after insertion of new objects).
D	AbstractMTreeNode.coveringRadius(DBID routingObjectID, AbstractMTree<O,D,N,E> mTree) Determines and returns the covering radius of this node.
void	AbstractMTreeNode.integrityCheck(AbstractMTree<O,D,N,E> mTree, E entry) Tests this node (for debugging purposes).
protected void	AbstractMTreeNode.integrityCheckParameters(E parentEntry, N parent, int index, AbstractMTree<O,D,N,E> mTree) Tests, if the parameters of the entry representing this node, are correctly set.

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

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

Subclasses of AbstractMTree 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.

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp with parameters of type AbstractMTree

void	MkAppTreeNode.adjustEntry(MkAppEntry<D> entry, DBID routingObjectID, D parentDistance, AbstractMTree<O,D,MkAppTreeNode<O,D>,MkAppEntry<D>> mTree) Adjusts the parameters of the entry representing this node.
protected void	MkAppTreeNode.integrityCheckParameters(MkAppEntry<D> parentEntry, MkAppTreeNode<O,D> parent, int index, AbstractMTree<O,D,MkAppTreeNode<O,D>,MkAppEntry<D>> mTree)

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

Subclasses of AbstractMTree 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.

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop with parameters of type AbstractMTree

void	MkCoPTreeNode.adjustEntry(MkCoPEntry<D> entry, DBID routingObjectID, D parentDistance, AbstractMTree<O,D,MkCoPTreeNode<O,D>,MkCoPEntry<D>> mTree)
protected void	MkCoPTreeNode.integrityCheckParameters(MkCoPEntry<D> parentEntry, MkCoPTreeNode<O,D> parent, int index, AbstractMTree<O,D,MkCoPTreeNode<O,D>,MkCoPEntry<D>> mTree)

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

Subclasses of AbstractMTree 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>>

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax with parameters of type AbstractMTree

void	MkMaxTreeNode.adjustEntry(MkMaxEntry<D> entry, DBID routingObjectID, D parentDistance, AbstractMTree<O,D,MkMaxTreeNode<O,D>,MkMaxEntry<D>> mTree) Calls the super method and adjust additionally the k-nearest neighbor distance of this node as the maximum of the k-nearest neighbor distances of all its entries.
protected void	MkMaxTreeNode.integrityCheckParameters(MkMaxEntry<D> parentEntry, MkMaxTreeNode<O,D> parent, int index, AbstractMTree<O,D,MkMaxTreeNode<O,D>,MkMaxEntry<D>> mTree) Calls the super method and tests if the k-nearest neighbor distance of this node is correctly set.

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

Subclasses of AbstractMTree 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.

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab with parameters of type AbstractMTree

void	MkTabTreeNode.adjustEntry(MkTabEntry<D> entry, DBID routingObjectID, D parentDistance, AbstractMTree<O,D,MkTabTreeNode<O,D>,MkTabEntry<D>> mTree)
protected void	MkTabTreeNode.integrityCheckParameters(MkTabEntry<D> parentEntry, MkTabTreeNode<O,D> parent, int index, AbstractMTree<O,D,MkTabTreeNode<O,D>,MkTabEntry<D>> mTree) Tests, if the parameters of the entry representing this node, are correctly set.

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

Subclasses of AbstractMTree 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.

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

Fields in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.query declared as AbstractMTree

protected AbstractMTree<O,D,?,?>	MetricalIndexRangeQuery.index The index to use
protected AbstractMTree<O,D,?,?>	MetricalIndexKNNQuery.index The index to use

Constructors in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.query with parameters of type AbstractMTree

MetricalIndexKNNQuery(AbstractMTree<O,D,?,?> index, DistanceQuery<O,D> distanceQuery)
Constructor.

MetricalIndexRangeQuery(AbstractMTree<O,D,?,?> index, DistanceQuery<O,D> distanceQuery)
Constructor.

Uses of AbstractMTree in de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d

Fields in de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d declared as AbstractMTree

protected AbstractMTree<NV,D,N,E>

TreeSphereVisualization.tree The tree we visualize

Methods in de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d with parameters of type AbstractMTree

static boolean	TreeSphereVisualization.canVisualize(AbstractMTree<?,?,?,?> tree) Test for a visualizable index in the context's database.
static Double	TreeSphereVisualization.getLPNormP(AbstractMTree<?,?,?,?> tree) Get the "p" value of an Lp norm.
private void	TreeSphereVisualization.visualizeMTreeEntry(SVGPlot svgp, Element layer, Projection2D proj, AbstractMTree<NV,D,N,E> mtree, E entry, int depth) Recursively draw the MBR rectangles.