Experiments on R-trees |
|
|
- Split time increases with page size
|
|
- Decreases with increasing
![](images/img41.png)
|
|
|
- Becomes very high with large m due to lots of re-inserts
|
|
|
- Relatively insensitive to splitting algorithms
|
|
- Less random I/O cost but more CPU cost with larger page size
|
|
- Slight effect of
: increases with ![](images/img41.png)
|
|
- Size of index decreases with increasing
![](images/img41.png)
|