All pairs similarity search on binary sketches in the Hamming space

This library provides a fast and compact all pairs similarity search (or similarity self-join) on binary sketches in the Hamming space. The algorithm employs a modified variant of the sketch sorting approach, a combination of the multiple sorting and the multi-index approach.

This library is a part of find-simdoc.

lib.rs:

This library provides a fast and compact all pairs similarity search (or similarity self-join) on binary sketches in the Hamming space. The algorithm employs a modified variant of the sketch sorting approach, a combination of the multiple sorting and the multi-index approach.