Get the latest tech news
Hann: A Fast Approximate Nearest Neighbor Search Library for Go
A fast approximate nearest neighbor search library for Go - habedi/hann
Currently, supported indexes include Hierarchical Navigable Small World (HNSW), Product Quantization Inverted File (PQIVF), and Random Projection Tree (RPT). Higher values improve split quality at the cost of increased indexing time (typical range: 1–10). Higher values improve recall but increase search overhead because of additional distance computations (typical range: 0.1–0.5).
Or read this on Hacker News