Splitting a R*-tree

• Sort entries in increasing order on each axis

• Sort by upper values of their rectangles

• M-2m+2 distributions of the M+1 entries into 2 groups

• For each distributions compute goodness values

  • Goodness values determine the final distribution

Previous slide

Next slide

Back to first slide

View graphic version