R-trees

• Non-leaf: ref= child addr, rect = MBR(child)

• M= # of entries, m= min. # of entries

• Root: at least 2 children unless leaf

• Tree is balanced

• Insertions & deletions are dynamic

• R*trees: same structure, reduce overlap

Previous slide

Next slide

Back to first slide

View graphic version