Module 3: Hashing
  Lecture 11: Locality Sensitive Hashing and Grid File
 

                                          

 

 

Searching
  • Point queries take at most 2 disk accesses
  • Range queries are much more expensive
 
  • Lower dimensional slice cuts through all buckets in remaining dimensions
 
  • In each dimension, "fringe buckets" are also accessed