Review

The R*-Tree paper has been the starting point for many researchers working in the area of spatial data indexing. It adapts the well known and very influential R-Tree structure to perform more efficiently in the case of point and window queries. The paper's contribution is twofold: first it presents new algorithms for partitioning spatial data objects in order to build the nodes of the tree, and second it provides a good performance comparison that served as a model for subsequent performance studies. A major positive aspect is that in the course of deriving new partitioning algorithms, it provided a lot of insight into what are the major factors impacting the performance of the structure (e.g. the fact that the perimeter of the objects is the determinant factor and needs to be accounted for when designing partitioning algorithms). Needless to say that the R*-Tree has served as the basic implementation of R-trees since then and has influenced a lot of researchers.
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.