title: How to bucket locality-sensitive hashes?
body: <p>I already have the algorithm to produce locality-sensitive hashes, but how should I bucket them to take advantage of their characteristics(i.e. similar elements have near hashes(with the hamming distance))? </p>
  
  <p>In the matlab code I found they simply create a distance matrix between the hashes of the points to search and the hashes of the points in the database, to simplify the code,while referencing a so called Charikar method for an actually good implementation of the search method. </p>
  
  <p>I tried to search for that, but I'm not sure how to apply to my case any of the methods I found(like the multi-probe method). None of these techniques seems easily pluggable if you already have the hashes. Is there any simple example code for this? Or any suggestion?</p>
  
  <p>This is the link to the page with the matlab code I'm talking about:
  <a href="http://www.eecs.berkeley.edu/~kulis/klsh/klsh.htm" rel="nofollow">http://www.eecs.berkeley.edu/~kulis/klsh/klsh.htm</a></p>