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

                                            

 

 

kNN queries
  • Query and a positive integer
  • For , compute minimum distance to any object in it
 
  • Maintain a heap with distance to object as
  • Prune if
 
  • Initially,
  • Traverse children in sorted order of