Module 5: Disk-based Index Structures
  Lecture 23: X-tree
 

                                           

 

 

Insertion and splitting
  • Two policies of splitting
 
  • Topological split
 
  • Overlap-minimal split
  • 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
  • Overlap-minimal split