Our great sponsors
-
annoy
Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
Probably I won't be bale to explain better than it's stated on annoy page: https://github.com/spotify/annoy But the bottom line is speed. Instead of computing similarities of embeddings one by one you do it via index that works way faster.
Plus the graph posted there is rather self explanatory. Also it gives you names of competing libraries and their benchmarks. As you can see ScaNN is the best so far, but I use annoy since its speed is sufficient for me (I usually need to match around 10k strings to 80k strings) and it's usage is very simple and straightforward.
Plus the graph posted there is rather self explanatory. Also it gives you names of competing libraries and their benchmarks. As you can see ScaNN is the best so far, but I use annoy since its speed is sufficient for me (I usually need to match around 10k strings to 80k strings) and it's usage is very simple and straightforward.