Class ApproximativeLeastOverlapInsertionStrategy

  • All Implemented Interfaces:
    InsertionStrategy

    @Reference(authors="Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger",
               title="The R*-tree: an efficient and robust access method for points and rectangles",
               booktitle="Proc. 1990 ACM SIGMOD Int. Conf. Management of Data",
               url="https://doi.org/10.1145/93597.98741",
               bibkey="DBLP:conf/sigmod/BeckmannKSS90")
    public class ApproximativeLeastOverlapInsertionStrategy
    extends LeastOverlapInsertionStrategy
    The choose subtree method proposed by the R*-Tree with slightly better performance for large leaf sizes (linear approximation).

    Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger
    The R*-tree: an efficient and robust access method for points and rectangles
    Proc. 1990 ACM SIGMOD Int. Conf. Management of Data

    Since:
    0.5.0
    Author:
    Erich Schubert, Franz Graf, Marisa Thoma
    • Field Detail

      • numCandidates

        private int numCandidates
        Number of candidates to consider
    • Constructor Detail

      • ApproximativeLeastOverlapInsertionStrategy

        public ApproximativeLeastOverlapInsertionStrategy​(int candidates)
        Constructor.