@Reference(authors="P. Ciaccia, M. Patella, P. Zezula", title="M-tree: An Efficient Access Method for Similarity Search in Metric Spaces", booktitle="Proc. Int. Conf. Very Large Data Bases (VLDB\'97)", url="http://www.vldb.org/conf/1997/P426.PDF", bibkey="DBLP:conf/vldb/CiacciaPZ97") public class MinimumEnlargementInsert<N extends AbstractMTreeNode<?,N,E>,E extends MTreeEntry> extends java.lang.Object implements MTreeInsert<E,N>
Reference:
P. Ciaccia, M. Patella, P. Zezula
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
In Proc. Int. Conf. Very Large Data Bases (VLDB'97)
Constructor and Description |
---|
MinimumEnlargementInsert() |
Modifier and Type | Method and Description |
---|---|
IndexTreePath<E> |
choosePath(AbstractMTree<?,N,E,?> tree,
E object)
Choose the subpath to insert into.
|
private IndexTreePath<E> |
choosePath(AbstractMTree<?,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<?,N,E,?> tree, E object)
MTreeInsert
choosePath
in interface MTreeInsert<E extends MTreeEntry,N extends AbstractMTreeNode<?,N,E>>
tree
- Tree to processobject
- Object to insertprivate IndexTreePath<E> choosePath(AbstractMTree<?,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 © 2019 ELKI Development Team. License information.