•The R*-tree attempts to reduce the tree, using a combination of arevised node split algorithm

and the concept offorced reinsertion atnode overflow. This is based on the observation thatR-tree structuresare highly susceptible to the order

in which their entries are inserted,so an insertion-built (rather than bulk-loaded) structure is likely to besub-optimal. Deletion and reinsertion of entries allows them to "find" aplace in the tree that may bemore appropriate than their originallocation.