Insertion and splitting |
- Two policies of splitting
|
|
|
|
|
- Split only if overlap below threshold
|
- Threshold determined by access time parameters
|
- Modifying and writing supernodes may require multiple disk accesses
|
|
- Assumes availability of contiguous pages on disk
|
- Topological split is similar to that of R*-tree
|
|