1 unstable release
Uses old Rust 2015
0.1.0 | May 25, 2017 |
---|
#13 in #locality
2MB
711 lines
O2LSH is a Rust crate for locality-sensitive hashing. It is heavily inspired by E2LSH. Information about the underlying algorithms can be found at http://www.mit.edu/~andoni/LSH/.
The code is currently licensed under MPL 2.0.
This code remains a work in progress. If you were hoping to use locality sensitive hashing right now in another Rust package, this probably won't get you there at the moment.
Roadmap:
- simplification of data structures/types
- provision of a C and Python interface
- integration with the ANN benchmark
- optimizations and performance improvements
lib.rs
:
This is O2LSH, a crate for locality-sensitive hashing. The idea is to efficiently (linear time) build a hash table such that similar items collide with high probability, and dissimilar items collide with low probability. One can adjust the precision of the hash function, and increase recall with redundant tables.
Dependencies
~4MB
~70K SLoC