How to construct R Tree(STR Method) with rectangle bounding boxes?

940 Views Asked by At

How to construct R Tree based on Sort Tile Recursion Method of rectangle bounding boxes along with searching alone? Totally 12 bounding boxes with (minx, miny) & (maxx , maxy)

I don't need to delete or update any nodes.

1

There are 1 best solutions below

0
On

Check the original paper... you use the mean. In fact this problem arises with point data, too: after a first bulk loading step you may have more pages than fit the root node, so you need to bulk-load another level.

For point data, STR bulk loaded pages will not overlap; at higher levels and for rectangles they will likely do. The popularity of STR probably stems a lot from point data.

P.S. with a total of 12 bounding boxes, using an R-Tree sounds like overkill to me. I'd set the page size clearly larger than 12 entries. And well, when your tree consists of a single node, it isn't really a tree ...