Skip to content. | Skip to navigation

Informatik 5
Information Systems
Prof. Dr. M. Jarke
Personal tools
You are here: Home Theses Locality-sensitive Hashing with Undecisive Hash Functions


Prof. Dr. M. Jarke
RWTH Aachen
Informatik 5
Ahornstr. 55
D-52056 Aachen
Tel +49/241/8021501
Fax +49/241/8022321

How to find us

Annual Reports





Locality-sensitive Hashing with Undecisive Hash Functions

Thesis type
  • Master
Status Running

Locality-sensitive hashing (LSH) is used to speed up near-neighbor search in high dimensional space. LSH works by hashing the elements to discrete buckets. However, in some cases the hash function has to make a decision which leads to similar points being hashed apart. This, for instance, happens when a point is close to a hyperplane in RHH. One solution to this problem is to hash several small perturbations of the points and insert all of them into the indexes. Other solutions also exist. This thesis will look into the different options for improving the performance of LSH by hashing points to multiple buckets instead of just one.


some pre-existing knowledge about LSH is useful, but this can also be studied as a preparation for the topic.

Document Actions