Analysis of object oriented spatial access methods

摘要: This paper provides an analysis of R-trees and a variation (R+-trees) that avoids overlapping rectangles in intermediate nodes the tree. The main contributions are following. We provide first known R-trees. Although formulas given for objects one dimension (line segments), they can be generalized higher dimensions as well. show how transformation to [HINR83] effectively used tool R- R+- trees. Finally, we derive R+-trees compare two methods analytically. results obtained require less than half disk accesses required by corresponding R-tree when searching files real life sizes clearly superior cases where there few long segments lot small ones.