We review the basic notion of locality sensitive hashing, a technique that clusters objects by similarity (rather than avoiding hash collisions for even minimally different objects, as in typical hashing), with a bit of personal history regarding the development of the idea and applications.