4/8/10
The R*-tree: An Efficient Robust Access Method for Points and Rectangles
This paper elaborates further on the Guttman's R-tree and discuss several drawbacks of the Guttman's version. Then it put forward a new variant of R-tree: the R* tree which largely improve the performance of spatial access.
Summary of the paper:
- Summarize of the main property of R-tree
Its spatial access method(SAM) is mainly based on overlapping regions by using minimum bound rectangles(directory rectangles).
The R-tree is based on a heuristic optimization and the optimization criterion it persues is to minimize th