Modifier and Type | Field and Description |
---|---|
private IndexTree<N,E> |
BreadthFirstEnumeration.index
The index storing the nodes.
|
Constructor and Description |
---|
BreadthFirstEnumeration(IndexTree<N,E> index,
IndexTreePath<E> rootPath)
Creates a new breadth first enumeration with the specified node as root
node.
|
Modifier and Type | Class and Description |
---|---|
class |
MetricalIndexTree<O,D extends Distance<D>,N extends Node<E>,E extends Entry>
Abstract super class for all metrical index classes.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractMTree<O,D extends NumberDistance<D,?>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry,S extends MTreeSettings<O,D,N,E>>
Abstract super class for all M-Tree variants.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractMkTree<O,D extends NumberDistance<D,?>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry,S extends MTreeSettings<O,D,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,D extends NumberDistance<D,?>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry,S extends MkTreeSettings<O,D,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.
|
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 NumberDistance<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 NumberDistance<D,?>>
MkMax tree
|
Modifier and Type | Class and Description |
---|---|
class |
MkTabTree<O,D extends NumberDistance<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 NumberDistance<D,?>>
MkTabTree used as database index.
|
Modifier and Type | Class and Description |
---|---|
class |
MTree<O,D extends NumberDistance<D,?>>
MTree is a metrical index structure based on the concepts of the M-Tree.
|
class |
MTreeIndex<O,D extends NumberDistance<D,?>>
Class for using an m-tree as database index.
|
Modifier and Type | Class and Description |
---|---|
class |
SpatialIndexTree<N extends SpatialNode<N,E>,E extends SpatialEntry>
Abstract super class for all spatial index tree classes.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,S extends AbstractRTreeSettings>
Abstract superclass for index structures based on a R*-Tree.
|
class |
NonFlatRStarTree<N extends AbstractRStarTreeNode<N,E>,E extends SpatialEntry,S extends AbstractRTreeSettings>
Abstract superclass for all non-flat R*-Tree variants.
|
Modifier and Type | Class and Description |
---|---|
class |
DeLiCluTree
DeLiCluTree is a spatial index structure based on an R-Tree.
|
class |
DeLiCluTreeIndex<O extends NumberVector<?>>
The common use of the DeLiClu tree: indexing number vectors.
|
Modifier and Type | Class and Description |
---|---|
class |
RStarTree
RStarTree is a spatial index structure based on the concepts of the R*-Tree.
|
class |
RStarTreeIndex<O extends NumberVector<?>>
The common use of the rstar tree: indexing number vectors.
|