| Package | Description | 
|---|---|
| de.lmu.ifi.dbs.elki.index.preprocessed.knn | 
 Indexes providing KNN and rKNN data. 
 | 
| 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 | |
| de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop | |
| de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax | |
| de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab | |
| de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree | 
| Modifier and Type | Method and Description | 
|---|---|
private MetricalIndexTree<O,D,N,E> | 
MetricalIndexApproximationMaterializeKNNPreprocessor.getMetricalIndex(Relation<O> relation)
Do some (limited) type checking, then cast the database into a spatial
 database. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
AbstractMTree<O,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Abstract super class for all M-Tree variants. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
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. 
 | 
class  | 
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. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
MkAppTree<O,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. 
 | 
class  | 
MkAppTreeIndex<O,D extends NumberDistance<D,?>>
MkAppTree used as database index. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
MkCoPTree<O,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. 
 | 
class  | 
MkCoPTreeIndex<O,D extends NumberDistance<D,?>>
MkCoPTree used as database index. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
MkMaxTree<O,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 <= k_max. 
 | 
class  | 
MkMaxTreeIndex<O,D extends Distance<D>>  | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
MkTabTree<O,D extends Distance<D>>
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,D extends Distance<D>>
MkTabTree used as database index. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
MTree<O,D extends Distance<D>>
MTree is a metrical index structure based on the concepts of the M-Tree. 
 | 
class  | 
MTreeIndex<O,D extends Distance<D>>
Class for using an m-tree as database index. 
 |