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

Class	Description
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.
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.
AbstractMkTreeUnifiedFactory<O,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry,S extends MkTreeSettings<O,N,E>>	Abstract factory for various Mk-Trees
AbstractMkTreeUnifiedFactory.Parameterizer<O,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry,S extends MkTreeSettings<O,N,E>>	Parameterization class.
MkTreeHeader	Encapsulates the header information for subclasses of AbstractMkTreeUnified.
MkTreeSettings<O,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry>	Class with settings for MkTrees.

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