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 Searching   Relatively insensitive to splitting algorithms   Less random I/O cost but more CPU cost with larger page size   Slight effect of : increases with   Size of index decreases with increasing R-trees quite suitable for relational databases