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	Package collects variants of the M-Tree.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mkapp	Package collects classes for the MkAppTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mkcop	Package collects classes for the MkCoPTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mkmax	Package collects classes for the MkMaxTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktab	Package collects classes for the MkTabTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree	Package collects classes for the 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.
D	AbstractMTreeNode.coveringRadius(Integer routingObjectID, AbstractMTree<O,D,N,E> mTree) Determines and returns the covering radius of this node.
void	AbstractMTreeNode.test(AbstractMTree<O,D,N,E> mTree, E entry) Tests this node (for debugging purposes).
protected void	AbstractMTreeNode.test(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.mkapp

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

class

MkAppTree<O extends DatabaseObject,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.

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

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

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

class

MkCoPTree<O extends DatabaseObject,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.

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

void	MkCoPTreeNode.adjustEntry(MkCoPEntry<D> entry, Integer routingObjectID, D parentDistance, AbstractMTree<O,D,MkCoPTreeNode<O,D>,MkCoPEntry<D>> mTree)
protected void	MkCoPTreeNode.test(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.mkmax

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

class

MkMaxTree<O extends DatabaseObject,D extends Distance<D>> MkNNTree is a metrical index structure based on the concepts of the M-Tree supporting efficient processing of reverse k nearest neighbor queries.

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.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)
protected void	MkMaxTreeNode.test(MkMaxEntry<D> parentEntry, MkMaxTreeNode<O,D> parent, int index, AbstractMTree<O,D,MkMaxTreeNode<O,D>,MkMaxEntry<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.mktab

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

class

MkTabTree<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 < kmax.

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.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.test(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.