| Package | Description |
|---|---|
| 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 | |
| de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.query |
Classes for performing queries (knn, range, ...) on metrical trees.
|
| de.lmu.ifi.dbs.elki.visualization.visualizers.vis2d |
Visualizers based on 2D projections.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractMTreeFactory<O,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>,I extends AbstractMTree<O,D,N,E> & Index>
Abstract factory for various MTrees
|
| Modifier and Type | Method and Description |
|---|---|
void |
AbstractMTreeNode.adjustEntry(E entry,
DBID routingObjectID,
D parentDistance,
AbstractMTree<O,D,N,E> mTree)
Adjusts the parameters of the entry representing this node (e.g. after
insertion of new objects).
|
D |
AbstractMTreeNode.coveringRadius(DBID routingObjectID,
AbstractMTree<O,D,N,E> mTree)
Determines and returns the covering radius of this node.
|
void |
AbstractMTreeNode.integrityCheck(AbstractMTree<O,D,N,E> mTree,
E entry)
Tests this node (for debugging purposes).
|
protected void |
AbstractMTreeNode.integrityCheckParameters(E parentEntry,
N parent,
int index,
AbstractMTree<O,D,N,E> mTree)
Tests, if the parameters of the entry representing this node, are correctly
set.
|
| 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 | Method and Description |
|---|---|
void |
MkAppTreeNode.adjustEntry(MkAppEntry<D> entry,
DBID routingObjectID,
D parentDistance,
AbstractMTree<O,D,MkAppTreeNode<O,D>,MkAppEntry<D>> mTree)
Adjusts the parameters of the entry representing this node.
|
protected void |
MkAppTreeNode.integrityCheckParameters(MkAppEntry<D> parentEntry,
MkAppTreeNode<O,D> parent,
int index,
AbstractMTree<O,D,MkAppTreeNode<O,D>,MkAppEntry<D>> mTree) |
| 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 | Method and Description |
|---|---|
void |
MkCoPTreeNode.adjustEntry(MkCoPEntry<D> entry,
DBID routingObjectID,
D parentDistance,
AbstractMTree<O,D,MkCoPTreeNode<O,D>,MkCoPEntry<D>> mTree) |
protected void |
MkCoPTreeNode.integrityCheckParameters(MkCoPEntry<D> parentEntry,
MkCoPTreeNode<O,D> parent,
int index,
AbstractMTree<O,D,MkCoPTreeNode<O,D>,MkCoPEntry<D>> mTree) |
| 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 | Method and Description |
|---|---|
void |
MkMaxTreeNode.adjustEntry(MkMaxEntry<D> entry,
DBID routingObjectID,
D parentDistance,
AbstractMTree<O,D,MkMaxTreeNode<O,D>,MkMaxEntry<D>> mTree)
Calls the super method and adjust additionally the k-nearest neighbor
distance of this node as the maximum of the k-nearest neighbor distances of
all its entries.
|
protected void |
MkMaxTreeNode.integrityCheckParameters(MkMaxEntry<D> parentEntry,
MkMaxTreeNode<O,D> parent,
int index,
AbstractMTree<O,D,MkMaxTreeNode<O,D>,MkMaxEntry<D>> mTree)
Calls the super method and tests if the k-nearest neighbor distance of this
node is correctly set.
|
| 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 | Method and Description |
|---|---|
void |
MkTabTreeNode.adjustEntry(MkTabEntry<D> entry,
DBID routingObjectID,
D parentDistance,
AbstractMTree<O,D,MkTabTreeNode<O,D>,MkTabEntry<D>> mTree) |
protected void |
MkTabTreeNode.integrityCheckParameters(MkTabEntry<D> parentEntry,
MkTabTreeNode<O,D> parent,
int index,
AbstractMTree<O,D,MkTabTreeNode<O,D>,MkTabEntry<D>> mTree)
Tests, if the parameters of the entry representing this node, are correctly
set.
|
| 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.
|
| Modifier and Type | Field and Description |
|---|---|
protected AbstractMTree<O,D,?,?> |
MetricalIndexRangeQuery.index
The index to use
|
protected AbstractMTree<O,D,?,?> |
MetricalIndexKNNQuery.index
The index to use
|
| Constructor and Description |
|---|
MetricalIndexKNNQuery(AbstractMTree<O,D,?,?> index,
DistanceQuery<O,D> distanceQuery)
Constructor.
|
MetricalIndexRangeQuery(AbstractMTree<O,D,?,?> index,
DistanceQuery<O,D> distanceQuery)
Constructor.
|
| Modifier and Type | Field and Description |
|---|---|
protected AbstractMTree<NV,D,N,E> |
TreeSphereVisualization.tree
The tree we visualize
|
| Modifier and Type | Method and Description |
|---|---|
static boolean |
TreeSphereVisualization.canVisualize(AbstractMTree<?,?,?,?> tree)
Test for a visualizable index in the context's database.
|
static Double |
TreeSphereVisualization.getLPNormP(AbstractMTree<?,?,?,?> tree)
Get the "p" value of an Lp norm.
|
private void |
TreeSphereVisualization.visualizeMTreeEntry(SVGPlot svgp,
Element layer,
Projection2D proj,
AbstractMTree<NV,D,N,E> mtree,
E entry,
int depth)
Recursively draw the MBR rectangles.
|
){kind=link}