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

                                           

 

 

Overlap-minimal split
  • Split tree is maintained to ascertain which dimensions have been split
 
  • Internal node encodes split history
  • Dimension at the root of the split is the split axis
 
  • For point data, overlap-free split is possible
  • May lead to underflow, and split may be rejected
  • Requires extra storage of split history at each node