3 ms·
Not the author, but at work we've had in the hundreds of millions. Faiss can certainly scale. If you do have a tiny index and want to try Google's version of v
by m3at 5y ago
Not the author, but at work we've had in the hundreds of millions. Faiss can certainly scale.
If you do have a tiny index and want to try Google's version of vector search (as an alternative to Faiss), you can easily run ScaNN locally [1] (linked in the article, that's the underlying tech). On small scale I had better perf with ScaNN
[1] https://github.com/google-research/google-research/tree/master/scann https://github.com/google-research/google-research/tree/mast...
- freediver 5y agoThanks for mentioning it. Just tried it and it seems to be faster than Faiss indeed on smaller scale searches.
- leobg 5y agoThere's also hnswlib[1], which has supposedly lower memory requirements and allows for adding new vectors to an existing index. [1]: https://github.com/nmslib/hnswlib/ https://github.com/nmslib/hnswlib/