The R*-tree: an efficient and robust access method for points and rectangles

Abstract

The R-tree, one of the most popular access methods for rectangles, IS based on the heurlstlc optlmlzatlon of the area of the enclosmg rectangle m each mner node By running numerous experiments m a standardized testbed under highly varying data, queries and operations, we were able to design the R*-tree which mcorporates a combined optlmlzatlon of area, margin and overlap of each enclosmg rectangle m the directory Using our standardized testbed m an exhaustive performance comparison, It turned out that the R*-tree clearly outperforms the exlstmg R-tree varmnts Guttman's linear and quadratic R-tree and Greene's variant of the R-tree This superlorlty of the R*-tree holds for different types of queries and operations, such as map overlay. for both rectangles and multldlmenslonal points m all experiments From a practical pomt of view the R*-tree 1s very attractive because of the followmg two reasons 1 It effrclently supports pomt and spattal data at the same time and 2 Its lmplementatlon cost 1s only slightly higher than that of other R-trees l.Introduction In this paper we will consider spatial access methods (SAMs) which are based on the approxlmatlon of a complex spatial object by the mmlmum boundmg rectangle with the sides of the rectangle parallel to the axes of the data space yIp---+ This work was supported by grant no Kr 670/4-3 from the Deutsche Forschun&iememschaft (German Research Society) and by the Mmlstry of Environmental and Urban Planning of Bremen Pemxss~on to copy wthout fee all or part of this maternal IS granted prowded that the copses are not made or dlstnbuted for dwzct commeraal advantage, the ACM copy&t notice and the title of the pubbcatlon and its date appear, and notw IS gwn that cqymg II by pemuwon of the Assoaatlon for Computmg Machmq To copy othemw, or to repubbsh requ,res a fee and/or speoflc pemllsslon 0 1990 ACM 089791365 5/!90/0@35/0322 $150The most important property of this simple approxlmatlon 1s that a complex object 1s represented by a limited number of bytes Although a lot of mformatlon 1s lost, mnumum bounding rectangles of spatial oblects preserve the most essential geometric properties of the object, 1 e the location of the oblect and the extension of the object in each axisIn [SK 881 we showed that known SAMs organlzmg (mmlmum bounding) rectangles are based on an underlymg point access method (PAM) using one of the followmg three techniques cllpplng, transformation and overlapping regionsThe most popular SAM for storing rectangles 1s the Rtree [Gut 841 Followmg our classlflcatlon, the R-tree 1s based on the PAM B+-tree [Knu 731 usmg the technique over-lapping regions Thus the R-tree can be easily implemented which considerably contributes to Its popularity The R-tree 1s based on a heurlstlc optlmlzatlon The optlmlzatton crlterlon which It persues, 1s to mmlmlze the area of each enclosing rectangle m the mner nodes This crlterlon IS taken for granted and not shown to be the best possible Questions arise such as Why not mnumlze the margin or the overlap of such mlnlmum...

A State-of-Art in R-Tree Variants for Spatial Indexing

“…The variants include R+ Tree [3], R* Tree [4], Packed R-Tree [6], Buffer R-Tree [8], Priority RTree [24], X-Tree [10] and Multi Small Index [33]. Each differs from one another in their construction.…”

“…The aspects are minimization of overlap, area covered by the directory nodes (dead space should be minimum), margin (square gives the minimum margin for the given area) and maximizing storage utilization. The variant R* [4] is built by incorporating a few changes in concepts to the basic R-Tree. The changes are 1) while choosing sub-tree, if the node is nonleaf and points to the leaf then minimum overlap (area is considered only during tie) enlargement is considered.…”

“…There exist many node splitting algorithms in the literature. Linear, quadratic [2], R* [4], branch grafting [26], 2-3 splitting [7] are some of them. The following section briefs the process of searching, insertion, deletion and updating of data to the node and splitting the node.…”

Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval

“…1 Without a properly designed indexing structure, the retrieval of information may be reduced to a linear exhaustive search. On the other hand, a good indexing structure will make t h e retrieval accurate and computationally e cient.…”

Energy and performance considerations in work partitioning for mobile spatial queries

“…The Rtree [12] was initially proposed as an extension to the B-Tree structure for handling multidimensional data. Many variants of the R-Tree, such as R + -Tree [27] and R -Tree [4] have been studied. They differ in the algorithm that is used for insertion, specifically in splitting a node of the tree when its subtree is filled.…”