Module 5: Disk-based Index Structures
  Lecture 27: M-trees
 

                                            

 

 

Non-metric distances
  • Sequential scan
  • Approximations
  • Embedding into vector spaces
  • Make the distance function metric
 
  • Constant shift embedding
   
  • Assumes only triangular inequality is violated
   
  • Identify triplets where
   
  • Add a constant to each distance such that becomes
   
  • Pruning power suffers for large