|
|
|||||||||||||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use MTreeEntry | |
---|---|
de.lmu.ifi.dbs.elki.database | ELKI database layer - loading, storing, indexing and accessing 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 | 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.metrical.mtreevariants.split | Splitting strategies of nodes in an M-Tree (and variants). |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.database |
---|
Classes in de.lmu.ifi.dbs.elki.database with type parameters of type MTreeEntry | |
---|---|
class |
MetricalIndexDatabase<O extends DatabaseObject,D extends Distance<D>,N extends MetricalNode<N,E>,E extends MTreeEntry<D>>
MetricalIndexDatabase is a database implementation which is supported by a metrical index structure. |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants with type parameters of type MTreeEntry | |
---|---|
class |
AbstractMTree<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Abstract super class for all M-Tree variants. |
class |
AbstractMTreeNode<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Abstract super class for nodes in M-Tree variants. |
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants that implement MTreeEntry | |
---|---|
class |
MTreeDirectoryEntry<D extends Distance<D>>
Represents an entry in a directory node of an M-Tree. |
class |
MTreeLeafEntry<D extends Distance<D>>
Represents an entry in a leaf node of an M-Tree. |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees with type parameters of type MTreeEntry | |
---|---|
class |
AbstractMkTree<O extends DatabaseObject,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 specified parameter AbstractMkTree.K_MAX_PARAM . |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp |
---|
Subinterfaces of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp | |
---|---|
(package private) interface |
MkAppEntry<D extends NumberDistance<D,N>,N extends Number>
Defines the requirements for an entry in an MkCop-Tree node. |
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp that implement MTreeEntry | |
---|---|
(package private) class |
MkAppDirectoryEntry<D extends NumberDistance<D,N>,N extends Number>
Represents an entry in a directory node of a MkApp-Tree. |
(package private) class |
MkAppLeafEntry<D extends NumberDistance<D,N>,N extends Number>
Represents an entry in a leaf node of a MkApp-Tree. |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop |
---|
Subinterfaces of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop | |
---|---|
(package private) interface |
MkCoPEntry<D extends NumberDistance<D,N>,N extends Number>
Defines the requirements for an entry in an MkCop-Tree node. |
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop that implement MTreeEntry | |
---|---|
(package private) class |
MkCoPDirectoryEntry<D extends NumberDistance<D,N>,N extends Number>
Represents an entry in a directory node of an MkCop-Tree. |
(package private) class |
MkCoPLeafEntry<D extends NumberDistance<D,N>,N extends Number>
Represents an entry in a leaf node of a MkCoP-Tree. |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax |
---|
Subinterfaces of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax | |
---|---|
(package private) interface |
MkMaxEntry<D extends Distance<D>>
Defines the requirements for an entry in an MkMaxTreeNode . |
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax that implement MTreeEntry | |
---|---|
(package private) class |
MkMaxDirectoryEntry<D extends Distance<D>>
Represents an entry in a directory node of an MkMaxTree . |
(package private) class |
MkMaxLeafEntry<D extends Distance<D>>
Represents an entry in a leaf node of an MkMaxTree . |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab |
---|
Subinterfaces of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab | |
---|---|
(package private) interface |
MkTabEntry<D extends Distance<D>>
Defines the requirements for an entry in an MkCop-Tree node. |
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab that implement MTreeEntry | |
---|---|
(package private) class |
MkTabDirectoryEntry<D extends Distance<D>>
Represents an entry in a directory node of a MkTab-Tree. |
(package private) class |
MkTabLeafEntry<D extends Distance<D>>
Represents an entry in a leaf node of a MkTab-Tree. |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree |
---|
Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree that return MTreeEntry | |
---|---|
protected MTreeEntry<D> |
MTree.createNewDirectoryEntry(MTreeNode<O,D> node,
Integer routingObjectID,
D parentDistance)
|
protected MTreeEntry<D> |
MTree.createNewLeafEntry(O object,
D parentDistance)
|
protected MTreeEntry<D> |
MTree.createRootEntry()
|
Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree with parameters of type MTreeEntry | |
---|---|
protected void |
MTree.preInsert(MTreeEntry<D> entry)
Does nothing because no operations are necessary before inserting an entry. |
Uses of MTreeEntry in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split |
---|
Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.split with type parameters of type MTreeEntry | |
---|---|
class |
Assignments<D extends Distance<D>,E extends MTreeEntry<D>>
Encapsulates the attributes of an assignment during a split. |
class |
MLBDistSplit<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Encapsulates the required methods for a split of a node in an M-Tree. |
class |
MRadSplit<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Encapsulates the required methods for a split of a node in an M-Tree. |
class |
MTreeSplit<O extends DatabaseObject,D extends Distance<D>,N extends AbstractMTreeNode<O,D,N,E>,E extends MTreeEntry<D>>
Abstract super class for splitting a node in an M-Tree. |
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |