@Reference(authors="P. Ciaccia, M. Patella, P. Zezula", title="M-tree: An Efficient Access Method for Similarity Search in Metric Spaces", booktitle="VLDB\'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece", url="http://www.vldb.org/conf/1997/P426.PDF") public class MinimumEnlargementInsert<O,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry> extends Object implements MTreeInsert<O,N,E>
P. Ciaccia, M. Patella, P. Zezula
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
In Proceedings of 23rd International Conference on Very Large Data Bases
(VLDB'97), August 25-29, 1997, Athens, Greece
Constructor and Description |
---|
MinimumEnlargementInsert() |
Modifier and Type | Method and Description |
---|---|
IndexTreePath<E> |
choosePath(AbstractMTree<O,N,E,?> tree,
E object)
Choose the subpath to insert into.
|
private IndexTreePath<E> |
choosePath(AbstractMTree<O,N,E,?> tree,
E object,
IndexTreePath<E> subtree)
Chooses the best path of the specified subtree for insertion of the given
object.
|
public IndexTreePath<E> choosePath(AbstractMTree<O,N,E,?> tree, E object)
MTreeInsert
choosePath
in interface MTreeInsert<O,N extends AbstractMTreeNode<O,N,E>,E extends MTreeEntry>
tree
- Tree to processobject
- Object to insertprivate IndexTreePath<E> choosePath(AbstractMTree<O,N,E,?> tree, E object, IndexTreePath<E> subtree)
tree
- the tree to insert intoobject
- the entry to searchsubtree
- the subtree to be tested for insertionCopyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.