Module 5: Disk-based Index Structures
Lecture 20:
R-trees
Experiments on R-trees
Insertion
Split time increases with page size
Decreases with increasing
Deletion
Becomes very high with large m due to lots of re-inserts