Class MinimumEnlargementInsert<N extends AbstractMTreeNode<?,​N,​E>,​E extends MTreeEntry>

  • All Implemented Interfaces:
    MTreeInsert<E,​N>

    @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>
    Minimum enlargement insert - default insertion strategy for the M-tree.

    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)

    Since:
    0.6.0
    Author:
    Erich Schubert
    • Constructor Detail

      • MinimumEnlargementInsert

        public MinimumEnlargementInsert()
    • Method Detail

      • choosePath

        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.
        Parameters:
        tree - the tree to insert into
        object - the entry to search
        subtree - the subtree to be tested for insertion
        Returns:
        the path of the appropriate subtree to insert the given object