Uses of Interface
de.lmu.ifi.dbs.elki.index.tree.Node

Packages that use Node

de.lmu.ifi.dbs.elki.index.preprocessed.knn	Indexes providing KNN and rKNN data.
de.lmu.ifi.dbs.elki.index.tree	Tree-based index structures
de.lmu.ifi.dbs.elki.index.tree.metrical	Tree-based index structures for metrical vector spaces.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants	M-Tree and variants.
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.spatial	Tree-based index structures for spatial indexing.
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants	R*-Tree and variants.
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu	DeLiCluTree
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar	RStarTree
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util	Utilities for R*-Tree and variants.

Uses of Node in de.lmu.ifi.dbs.elki.index.preprocessed.knn

Classes in de.lmu.ifi.dbs.elki.index.preprocessed.knn with type parameters of type Node

class	MetricalIndexApproximationMaterializeKNNPreprocessor<O extends NumberVector<? super O,?>,D extends Distance<D>,N extends Node<E>,E extends MTreeEntry<D>> A preprocessor for annotation of the k nearest neighbors (and their distances) to each database object.
static class	MetricalIndexApproximationMaterializeKNNPreprocessor.Factory<O extends NumberVector<? super O,?>,D extends Distance<D>,N extends Node<E>,E extends MTreeEntry<D>> The parameterizable factory.
static class	MetricalIndexApproximationMaterializeKNNPreprocessor.Factory.Parameterizer<O extends NumberVector<? super O,?>,D extends Distance<D>,N extends Node<E>,E extends MTreeEntry<D>> Parameterization class.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree

Classes in de.lmu.ifi.dbs.elki.index.tree with type parameters of type Node

class	BreadthFirstEnumeration<N extends Node<E>,E extends Entry> Provides a breadth first enumeration over the nodes of an index structure.
class	IndexTree<N extends Node<E>,E extends Entry> Abstract super class for all tree based index classes.

Classes in de.lmu.ifi.dbs.elki.index.tree that implement Node

class

AbstractNode<E extends Entry> Abstract superclass for nodes in an tree based index structure.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.metrical

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical with type parameters of type Node

class

MetricalIndexTree<O,D extends Distance<D>,N extends Node<E>,E extends Entry> Abstract super class for all metrical index classes.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants that implement Node

class

AbstractMTreeNode<O,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>> Abstract super class for nodes in M-Tree variants.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp that implement Node

(package private) class

MkAppTreeNode<O,D extends NumberDistance<D,?>> Represents a node in an MkApp-Tree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop that implement Node

(package private) class

MkCoPTreeNode<O,D extends NumberDistance<D,?>> Represents a node in an MkCop-Tree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax that implement Node

(package private) class

MkMaxTreeNode<O,D extends Distance<D>> Represents a node in an MkMaxTree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab that implement Node

(package private) class

MkTabTreeNode<O,D extends Distance<D>> Represents a node in a MkMax-Tree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree that implement Node

class

MTreeNode<O,D extends Distance<D>> Represents a node in an M-Tree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.spatial

Subinterfaces of Node in de.lmu.ifi.dbs.elki.index.tree.spatial

interface

SpatialNode<N extends SpatialNode<N,E>,E extends SpatialEntry> Defines the requirements for an object that can be used as a node in a Spatial Index.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants that implement Node

class

AbstractRStarTreeNode<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry> Abstract superclass for nodes in a R*-Tree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu that implement Node

class

DeLiCluNode Represents a node in a DeLiClu-Tree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar

Classes in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar that implement Node

class

RStarTreeNode Represents a node in an R*-Tree.

Uses of Node in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util

Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.util with type parameters of type Node

<N extends Node<E>,E extends SpatialEntry> TreeIndexPathComponent<E>	ApproximateLeastOverlapInsertionStrategy.findInsertChild(N node, SpatialComparable mbr) Returns the path information of the entry of the specified node which needs least overlap enlargement if the given mbr would be inserted into.
<N extends Node<E>,E extends SpatialEntry> TreeIndexPathComponent<E>	InsertionStrategy.findInsertChild(N node, SpatialComparable mbr) Find the child to insert into.
<N extends Node<E>,E extends SpatialEntry> TreeIndexPathComponent<E>	LeastOverlapInsertionStrategy.findInsertChild(N node, SpatialComparable mbr) Returns the path information of the entry of the specified node which needs least overlap enlargement if the given mbr would be inserted into.