Uses of Class de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.AbstractMTree (ELKI: Environment for DeveLoping KDD-Applications Supported by Index-Structures)

Prev
Next

All Classes

Packages that use AbstractMTree
Package	Description
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.index.tree.metrical.mtreevariants.strategies.insert	Insertion (choose path) strategies of nodes in an M-Tree (and variants).
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.strategies.split	Splitting strategies of nodes in an M-Tree (and variants).
de.lmu.ifi.dbs.elki.visualization.visualizers.scatterplot.index	Visualizers for index structures 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
Modifier and Type	Class and Description
`class`	`AbstractMTreeFactory<O,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry,I extends AbstractMTree<O,N,E,S> & Index,S extends MTreeSettings<O,N,E>>` Abstract factory for various MTrees

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants with parameters of type AbstractMTree
Modifier and Type	Method and 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.
`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 de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees

Subclasses of AbstractMTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees
Modifier and Type	Class and 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 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
Modifier and Type	Class and 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 de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp with parameters of type AbstractMTree
Modifier and Type	Method and 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 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
Modifier and Type	Class and 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 de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop with parameters of type AbstractMTree
Modifier and Type	Method and 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 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
Modifier and Type	Class and 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 de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax with parameters of type AbstractMTree
Modifier and Type	Method and 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 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
Modifier and Type	Class and 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 de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab with parameters of type AbstractMTree
Modifier and Type	Method and 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 de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree

Subclasses of AbstractMTree in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree
Modifier and Type	Class and 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 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
Modifier and Type	Field and Description
`protected AbstractMTree<O,?,?,?>`	MetricalIndexRangeQuery.`index` The index to use
`protected AbstractMTree<O,?,?,?>`	MetricalIndexKNNQuery.`index` The index to use

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.query with parameters of type AbstractMTree
Modifier and Type	Method and Description
`static <O> KNNQuery<O>`	MTreeQueryUtil.`getKNNQuery(AbstractMTree<O,?,?,?> tree, DistanceQuery<O> distanceQuery, Object... hints)` Get an RTree knn query, using an optimized double implementation when possible.
`static <O> RangeQuery<O>`	MTreeQueryUtil.`getRangeQuery(AbstractMTree<O,?,?,?> tree, DistanceQuery<O> distanceQuery, Object... hints)` Get an RTree knn query, using an optimized double implementation when possible.

Constructors in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.query with parameters of type AbstractMTree
Constructor and Description
`MetricalIndexKNNQuery(AbstractMTree<O,?,?,?> index, DistanceQuery<O> distanceQuery)` Constructor.
`MetricalIndexRangeQuery(AbstractMTree<O,?,?,?> index, DistanceQuery<O> distanceQuery)` Constructor.

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

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.strategies.insert with parameters of type AbstractMTree
Modifier and Type	Method and Description
`IndexTreePath<E>`	MinimumEnlargementInsert.`choosePath(AbstractMTree<O,N,E,?> tree, E object)`
`IndexTreePath<E>`	MTreeInsert.`choosePath(AbstractMTree<O,N,E,?> tree, E object)` Choose the subpath to insert into.
`private IndexTreePath<E>`	MinimumEnlargementInsert.`choosePath(AbstractMTree<O,N,E,?> tree, E object, IndexTreePath<E> subtree)` Chooses the best path of the specified subtree for insertion of the given object.

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

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.strategies.split with parameters of type AbstractMTree
Modifier and Type	Method and Description
`(package private) Assignments<E>`	MTreeSplit.`balancedPartition(AbstractMTree<O,N,E,?> tree, N node, DBID routingObject1, DBID routingObject2)` Creates a balanced partition of the entries of the specified node.
`(package private) Assignments<E>`	MTreeSplit.`balancedPartition(AbstractMTree<O,N,E,?> tree, N node, int routingEntNum1, int routingEntNum2, double[] distanceMatrix)` Creates a balanced partition of the entries of the specified node.
`protected double[]`	MTreeSplit.`computeDistanceMatrix(AbstractMTree<O,N,E,?> tree, N node)` Compute the pairwise distances in the given node.
`Assignments<E>`	RandomSplit.`split(AbstractMTree<O,N,E,?> tree, N node)` Selects two objects of the specified node to be promoted and stored into the parent node.
`abstract Assignments<E>`	MTreeSplit.`split(AbstractMTree<O,N,E,?> tree, N node)` Returns the assignments of this split.
`Assignments<E>`	MRadSplit.`split(AbstractMTree<O,N,E,?> tree, N node)` Selects two objects of the specified node to be promoted and stored into the parent node.
`Assignments<E>`	MMRadSplit.`split(AbstractMTree<O,N,E,?> tree, N node)` Selects two objects of the specified node to be promoted and stored into the parent node.
`Assignments<E>`	MLBDistSplit.`split(AbstractMTree<O,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.

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

Fields in de.lmu.ifi.dbs.elki.visualization.visualizers.scatterplot.index declared as AbstractMTree
Modifier and Type	Field and Description
`protected AbstractMTree<?,N,E,?>`	TreeSphereVisualization.Instance.`tree` The tree we visualize

Methods in de.lmu.ifi.dbs.elki.visualization.visualizers.scatterplot.index with parameters of type AbstractMTree
Modifier and Type	Method and 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, Element layer, Projection2D proj, AbstractMTree<?,N,E,?> mtree, E entry, int depth)` Recursively draw the MBR rectangles.

ELKI Version 0.7.0

Prev
Next

All Classes

Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.