Class RStarTree

  • All Implemented Interfaces:
    Index
    Direct Known Subclasses:
    RStarTreeIndex

    @Title("R*-Tree")
    @Description("Balanced index structure based on bounding rectangles.")
    @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 abstract class RStarTree
    extends NonFlatRStarTree<RStarTreeNode,​SpatialEntry,​RTreeSettings>
    RStarTree is a spatial index structure based on the concepts of the R*-Tree. Apart from organizing the objects it also provides several methods to search for certain object in the structure and ensures persistence.

    Reference:

    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.1
    Author:
    Elke Achtert