Package 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.

See:
Description

Class Summary

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.
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.
AbstractMkTreeUnifiedFactory<O,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>,I extends AbstractMkTree<O,D,N,E> & Index>	Abstract factory for various Mk-Trees
AbstractMkTreeUnifiedFactory.Parameterizer<O,D extends Distance<D>>	Parameterization class.
MkTreeHeader	Encapsulates the header information for subclasses of AbstractMkTreeUnified.

Package de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees Description

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.