Java implementation of the the Hierarchical Navigable Small World graphs (HNSW) algorithm for doing approximate nearest neighbour search.
The index is thread safe, serializable, supports adding items to the index incrementally and has experimental support for deletes.
It's flexible interface makes it easy to apply it to use it with any type of data and distance metric.
The following distance metrics are currently pre-packaged :
- bray curtis dissimilarity
- canberra distance
- correlation distance
- cosine distance
- euclidean distance
- inner product
- manhattan distance
To find out more about how to use this library take a look at the hnswlib-examples module or browse the documentation in the readme files of the submodules