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

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

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

void	AbstractMTreeNode.adjustEntry(E entry, Integer 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(Integer 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 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 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 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.

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

void	MkAppTreeNode.adjustEntry(MkAppEntry<D,N> entry, Integer routingObjectID, D parentDistance, AbstractMTree<O,D,MkAppTreeNode<O,D,N>,MkAppEntry<D,N>> mTree) Adjusts the parameters of the entry representing this node.
protected void	MkAppTreeNode.integrityCheckParameters(MkAppEntry<D,N> parentEntry, MkAppTreeNode<O,D,N> parent, int index, AbstractMTree<O,D,MkAppTreeNode<O,D,N>,MkAppEntry<D,N>> 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 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.

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

void	MkCoPTreeNode.adjustEntry(MkCoPEntry<D,N> entry, Integer routingObjectID, D parentDistance, AbstractMTree<O,D,MkCoPTreeNode<O,D,N>,MkCoPEntry<D,N>> mTree)
protected void	MkCoPTreeNode.integrityCheckParameters(MkCoPEntry<D,N> parentEntry, MkCoPTreeNode<O,D,N> parent, int index, AbstractMTree<O,D,MkCoPTreeNode<O,D,N>,MkCoPEntry<D,N>> 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 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.

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

void	MkMaxTreeNode.adjustEntry(MkMaxEntry<D> entry, Integer 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 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.

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

void	MkTabTreeNode.adjustEntry(MkTabEntry<D> entry, Integer 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 extends DatabaseObject,D extends Distance<D>> MTree is a metrical index structure based on the concepts of the M-Tree.