spotify/annoy on Hacker News

…space, so memory usage is a prime concern. [0] https://erikbern.com/2013/04/12/annoy.html [1] https://github.com/spotify/annoy?tab=readme-ov-file

comment by vanderZwan · 2025-10-28 · in Should LLMs just treat text content as an image?

…to call `.add_item` at any time (I just pip installed to double check and yes -- it's great). [0] https://github.com/spotify/annoy#summary-of-features

comment by gregsadetsky · 2023-10-30 · in Approximate Nearest Neighbor Oh Yeah (Annoy)

…but it's not easy. Vector search isn't all that new a concept. For example, the annoy library ( https://github.com/spotify/annoy ) has been around since 2014. It was one of the first open source approximate nearest neighbor libraries.…

comment by dmezzetti · 2023-09-05 · in Do we think about vector storage wrong?

There's at least a repo: https://github.com/spotify/annoy

comment by fancy_pantser · 2023-05-07 · in Billion-Scale Approximate Nearest Neighbor Search [pdf]

…it matches too well: you get frames of people in identical positions but on different problems! [1] https://github.com/spotify/annoy

comment by nl · 2023-03-31 · in Faiss: A library for efficient similarity search

…or two from it. On the topic of vector search, I'm fairly certain that Spotify still uses Annoy ( https://github.com/spotify/annoy ). Like Faiss, it's a great library but not quite a database, which would ideally have features like…

comment by fzliu · 2022-11-30 · in Leaving Spotify for freer pastures

…and now it does! Source code's here if you're curious: https://github.com/manimino/ducks [1] Annoy: https://github.com/spotify/annoy

comment by manimino · 2022-09-22 · in Bitmap Indexes in Go: Search Speed (2019)

What about annoy? https://github.com/spotify/annoy I used this in the past. It will probably have it's limitations but worked great for me

comment by ParanoidShroom · 2022-09-05 · in Solr’s Dense Vector Search for indexing and searching dense numerical vectors

…text indices for a few years already[1], they just weren't combined with text generation. [1] https://github.com/spotify/annoy

comment by visarga · 2021-12-22 · in DeepMind’s new AI with a memory outperforms algorithms 25 times its size

See also: Ann-benchmarks[0], Annoy[1], ScaNN[2] [0]: http://ann-benchmarks.com [1]: https://github.com/spotify/annoy [2]: https://github.com/google-research/google-research/tree/mast...

comment by kristjansson · 2021-12-14 · in Faiss: Facebook's open source vector search library

…search before. Does anyone know the differences between Faiss and annoy? Thanks! [0] https://github.com/spotify/annoy

comment by gregsadetsky · 2021-11-20 · in Facebook AI Similarity Search (Faiss)

…[2] https://github.com/nmslib/hnswlib [3] http://infolab.stanford.edu/~ullman/mmds [4] https://github.com/spotify/annoy

comment by andyxor · 2021-06-24 · in Introduction to Locality-Sensitive Hashing

It's widely used in recommenders based on embeddings. See: https://github.com/spotify/annoy https://github.com/facebookresearch/faiss

comment by jalammar · 2021-06-24 · in Introduction to Locality-Sensitive Hashing

…options - ScaNN is too new to have solved your previous problem, but Annoy would have been great. - https://github.com/spotify/annoy - https://ai.googleblog.com/2020/07/announcing-scann-efficient...

comment by ml-thoughts2018 · 2021-04-09 · in Vald: A Highly Scalable Distributed Vector Search Engine

…years and it is fast, reliable, super easy to use and handles pretty large data quite well too. https://github.com/spotify/annoy

comment by mlthoughts20181 · 2021-04-09 · in Vald: A Highly Scalable Distributed Vector Search Engine

One of their ways: https://github.com/spotify/annoy

comment by franklampard · 2020-11-19 · in Nvidia Announces A100 80GB GPU for AI

…[2] https://authors.library.caltech.edu/7694/ [3] https://github.com/facebookresearch/faiss [4] https://github.com/spotify/annoy

comment by faustomorales · 2019-11-06 · in Show HN: Perceptual hashing tools for detecting child sexual abuse material

…me when it comes to "career thinking." And fun fact, he wrote Annoy, which is damn good software. https://github.com/spotify/annoy https://erikbern.com/2018/02/15/new-benchmarks-for-approxima...

comment by peter_l_downs · 2019-10-08 · in Miscellaneous unsolicited (and possibly biased) career advice

https://github.com/spotify/annoy

comment by thanatropism · 2019-09-19 · in Challenges in Implementing a Full-Text-Search Engine

…15 states from a year ago Better people: - Open source authors of popular projects like Annoy ( https://github.com/spotify/annoy ) and Holder ( https://github.com/imsky/holder ) - A Head of Engineering who writes a fun blog (…

comment by archerabi · 2019-08-01 · in Ask HN: Who is hiring? (August 2019)

Been using the annoy library lately ( https://github.com/spotify/annoy ) after becoming frustrated with TF not behaving as I'd expect. There's another lib in python, nmslib, but I can't get seem to get it to work right - and the docs are…

comment by meesterdude · 2019-06-03 · in Random Forest vs. Neural Network

How does it compare to Spotify “annoy” LSH https://github.com/spotify/annoy

comment by bra-ket · 2018-11-19 · in Show HN: All-pair similarity search on millions of sets in Python and on laptop

Take a look at the Annoy library https://github.com/spotify/annoy , implemented by a developer from Spotify. It uses K-nearest neighbour to find close data points.

comment by drewjaja · 2018-04-18 · in Ask HN: What are some good architectures for building recommendation systems?

…have to roll your own normalization and so on, but that's usually the less complicated part anyway. https://github.com/spotify/annoy

comment by polm23 · 2018-03-09 · in Building a Content-Based Search Engine II: Extracting Feature Vectors

…can create a very different perspective. doc2vecC: https://github.com/mchen24/iclr2017 annoy: https://github.com/spotify/annoy

comment by visarga · 2018-03-02 · in Understanding word vectors

…https://en.wikipedia.org/wiki/Curse_of_dimensionality [1] https://github.com/searchivarius/nmslib [2] https://github.com/spotify/annoy [3] https://github.com/facebookresearch/faiss [4] https://scaletext.com/

comment by Radim · 2018-02-11 · in Using k-d trees to efficiently calculate nearest neighbors in 3D vector space

…Faiss (Facebook): https://github.com/facebookresearch/faiss Annoy (Spotify): https://github.com/spotify/annoy

comment by jschmitz28 · 2018-01-18 · in Building Cross-Lingual End-to-End Product Search with Tensorflow

…and find similar documents in logarithmic time, so you can search in large tables by fuzzy meaning. https://github.com/spotify/annoy

comment by visarga · 2017-10-19 · in Word vectors are awesome but you don’t need a neural network to find them

…vectors in a larger than memory setting whilst supporting updates. Spotifys own Annoy is cool https://github.com/spotify/annoy , but changing or adding a song requires rebuilding the whole structure ... surely that's prohibitive at scale?

comment by anon1253 · 2017-10-11 · in Spotify’s Discover Weekly: How machine learning finds new music

…vector similarity search, try the "annoy" library from Spotify. It's much much faster than Gensim. https://github.com/spotify/annoy

comment by visarga · 2017-07-16 · in Show HN: Fastest search engine in the world

…logical step is to look at 'locality-sensitive hashing' and some simple state-of-the-art methods: https://github.com/spotify/annoy

comment by bra-ket · 2016-06-15 · in K-Nearest Neighbors from Scratch

…Spotify deserves a look for anyone who is outgrowing traditional nearest neighbor algorithms. [0] https://github.com/spotify/annoy

comment by itodd · 2016-04-13 · in Have You Tried Using a Nearest Neighbor Search?

…still approximative) query results. This is what Spotify's excellent Annoy library does. [1] [1] https://github.com/spotify/annoy

comment by fchollet · 2014-08-10 · in Fast and easy Levenshtein distance using a trie (2011)