Algorithm Choose Subtree
Choose rectangle in N that needs the least amount of overlap enlargement for to include new data
Resolve ties by using least area enlargement
Increases CPU cost
Cuts down on number of disk accesses
Previous slide
Next slide
Back to first slide
View graphic version