Uses of Class
elki.index.tree.metrical.mtreevariants.AbstractMTree

Packages that use AbstractMTree

Package	Description
elki.index.tree.metrical.mtreevariants	M-tree and variants.
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.
elki.index.tree.metrical.mtreevariants.mktrees.mkapp	MkAppTree.
elki.index.tree.metrical.mtreevariants.mktrees.mkcop	MkCoPTree.
elki.index.tree.metrical.mtreevariants.mktrees.mkmax	MkMaxTree.
elki.index.tree.metrical.mtreevariants.mktrees.mktab	MkTabTree.
elki.index.tree.metrical.mtreevariants.mtree	MTree.
elki.index.tree.metrical.mtreevariants.query	Classes for performing queries (knn, range, ...) on metrical trees.
elki.index.tree.metrical.mtreevariants.strategies.insert	Insertion (choose path) strategies of nodes in an M-tree (and variants).
elki.index.tree.metrical.mtreevariants.strategies.split	Splitting strategies of nodes in an M-tree (and variants).
elki.visualization.visualizers.scatterplot.index	Visualizers for index structures based on 2D projections.

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants

Methods in elki.index.tree.metrical.mtreevariants with parameters of type AbstractMTree

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

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees

Subclasses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees

Modifier and Type	Class	Description
class	AbstractMkTree<O,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry,S extends MTreeSettings<O,N,E>>	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,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry,S extends MkTreeSettings<O,N,E>>	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 elki.index.tree.metrical.mtreevariants.mktrees.mkapp

Subclasses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees.mkapp

Modifier and Type	Class	Description
class	MkAppTree<O>	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>	MkAppTree used as database index.

Methods in elki.index.tree.metrical.mtreevariants.mktrees.mkapp with parameters of type AbstractMTree

Modifier and Type	Method	Description
boolean	MkAppTreeNode.adjustEntry(MkAppEntry entry, DBID routingObjectID, double parentDistance, AbstractMTree<O,MkAppTreeNode<O>,MkAppEntry,?> mTree)	Adjusts the parameters of the entry representing this node.
protected void	MkAppTreeNode.integrityCheckParameters(MkAppEntry parentEntry, MkAppTreeNode<O> parent, int index, AbstractMTree<O,MkAppTreeNode<O>,MkAppEntry,?> mTree)

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees.mkcop

Subclasses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees.mkcop

Modifier and Type	Class	Description
class	MkCoPTree<O>	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>	MkCoPTree used as database index.

Methods in elki.index.tree.metrical.mtreevariants.mktrees.mkcop with parameters of type AbstractMTree

Modifier and Type	Method	Description
boolean	MkCoPTreeNode.adjustEntry(MkCoPEntry entry, DBID routingObjectID, double parentDistance, AbstractMTree<O,MkCoPTreeNode<O>,MkCoPEntry,?> mTree)
protected void	MkCoPTreeNode.integrityCheckParameters(MkCoPEntry parentEntry, MkCoPTreeNode<O> parent, int index, AbstractMTree<O,MkCoPTreeNode<O>,MkCoPEntry,?> mTree)

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees.mkmax

Subclasses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees.mkmax

Modifier and Type	Class	Description
class	MkMaxTree<O>	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>	MkMax tree

Methods in elki.index.tree.metrical.mtreevariants.mktrees.mkmax with parameters of type AbstractMTree

Modifier and Type	Method	Description
boolean	MkMaxTreeNode.adjustEntry(MkMaxEntry entry, DBID routingObjectID, double parentDistance, AbstractMTree<O,MkMaxTreeNode<O>,MkMaxEntry,?> 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 parentEntry, MkMaxTreeNode<O> parent, int index, AbstractMTree<O,MkMaxTreeNode<O>,MkMaxEntry,?> mTree)	Calls the super method and tests if the k-nearest neighbor distance of this node is correctly set.

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees.mktab

Subclasses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mktrees.mktab

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

Methods in elki.index.tree.metrical.mtreevariants.mktrees.mktab with parameters of type AbstractMTree

Modifier and Type	Method	Description
boolean	MkTabTreeNode.adjustEntry(MkTabEntry entry, DBID routingObjectID, double parentDistance, AbstractMTree<O,MkTabTreeNode<O>,MkTabEntry,?> mTree)
protected void	MkTabTreeNode.integrityCheckParameters(MkTabEntry parentEntry, MkTabTreeNode<O> parent, int index, AbstractMTree<O,MkTabTreeNode<O>,MkTabEntry,?> mTree)	Tests, if the parameters of the entry representing this node, are correctly set.

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mtree

Subclasses of AbstractMTree in elki.index.tree.metrical.mtreevariants.mtree

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

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.query

Fields in elki.index.tree.metrical.mtreevariants.query declared as AbstractMTree

Modifier and Type	Field	Description
protected AbstractMTree<O,?,?,?>	MTreeKNNByDBID.index	The index to use
protected AbstractMTree<O,?,?,?>	MTreeKNNByObject.index	The index to use
protected AbstractMTree<O,?,?,?>	MTreeRangeByDBID.index	The index to use
protected AbstractMTree<O,?,?,?>	MTreeRangeByObject.index	The index to use

Constructors in elki.index.tree.metrical.mtreevariants.query with parameters of type AbstractMTree

Constructor	Description
MTreeKNNByDBID(AbstractMTree<O,?,?,?> index, DistanceQuery<O> distanceQuery)	Constructor.
MTreeKNNByObject(AbstractMTree<O,?,?,?> index, DistanceQuery<O> distanceQuery)	Constructor.
MTreeRangeByDBID(AbstractMTree<O,?,?,?> index, DistanceQuery<O> distanceQuery)	Constructor.
MTreeRangeByObject(AbstractMTree<O,?,?,?> index, DistanceQuery<O> distanceQuery)	Constructor.

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.strategies.insert

Methods in elki.index.tree.metrical.mtreevariants.strategies.insert with parameters of type AbstractMTree

Modifier and Type	Method	Description
IndexTreePath<E>	MinimumEnlargementInsert.choosePath(AbstractMTree<?,N,E,?> tree, E object)
private IndexTreePath<E>	MinimumEnlargementInsert.choosePath(AbstractMTree<?,N,E,?> tree, E object, IndexTreePath<E> subtree)	Chooses the best path of the specified subtree for insertion of the given object.
IndexTreePath<E>	MTreeInsert.choosePath(AbstractMTree<?,N,E,?> tree, E object)	Choose the subpath to insert into.

Uses of AbstractMTree in elki.index.tree.metrical.mtreevariants.strategies.split

Methods in elki.index.tree.metrical.mtreevariants.strategies.split with parameters of type AbstractMTree

Modifier and Type	Method	Description
protected static <E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>> double[][]	AbstractMTreeSplit.computeDistanceMatrix(AbstractMTree<?,N,E,?> tree, N node)	Compute the pairwise distances in the given node.
Assignments<E>	FarthestPointsSplit.split(AbstractMTree<?,N,E,?> tree, N node)
Assignments<E>	MLBDistSplit.split(AbstractMTree<?,N,E,?> tree, N node)	Selects the second object of the specified node to be promoted and stored into the parent node and partitions the entries according to the M_LB_DIST strategy.
Assignments<E>	MMRadSplit.split(AbstractMTree<?,N,E,?> tree, N node)	Selects two objects of the specified node to be promoted and stored into the parent node.
Assignments<E>	MRadSplit.split(AbstractMTree<?,N,E,?> tree, N node)	Selects two objects of the specified node to be promoted and stored into the parent node.
Assignments<E>	MSTSplit.split(AbstractMTree<?,N,E,?> tree, N node)
Assignments<E>	MTreeSplit.split(AbstractMTree<?,N,E,?> tree, N node)	Returns the assignments of this split.
Assignments<E>	RandomSplit.split(AbstractMTree<?,N,E,?> tree, N node)	Selects two objects of the specified node to be promoted and stored into the parent node.

Uses of AbstractMTree in elki.visualization.visualizers.scatterplot.index

Fields in elki.visualization.visualizers.scatterplot.index declared as AbstractMTree

Modifier and Type	Field	Description
protected AbstractMTree<?,N,E,?>	TreeSphereVisualization.Instance.tree	The tree we visualize

Methods in elki.visualization.visualizers.scatterplot.index with parameters of type AbstractMTree

Modifier and Type	Method	Description
static boolean	TreeSphereVisualization.canVisualize(Relation<?> rel, 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.Instance.visualizeMTreeEntry(SVGPlot svgp, org.w3c.dom.Element layer, Projection2D proj, AbstractMTree<?,N,E,?> mtree, E entry, int depth)	Recursively draw the MBR rectangles.