On packing R-trees
Ibrahim Kamel, Christos Faloutsos · 1993
We propose new R-tree packing techniques for static databases.Given a collection of rectangles, we sort them and build the R-tree bottom-up.There are several ways time of a range query as a function of the geometric characteristics of the R-tree.