I would think it would depend some on the domain you were searching over. For example, here is a use case for FLSHclust: https://news.mit.edu/2023/search-algorithm-reveals-nearly-20...
Ask HN: What is the state of art approximate k-NN search algorithm today?
11–13 of 13 posts
Re: Ask HN: What is the state of art approximate k-NN search algorithm today?
#12If you are thinking of SOTA as just recall that's a bit different than if you are thinking about other performance considerations in real-world data sets.
For example, IVF generally requires that you process the entire dataset in order to build the index, so it doesn't become searchable for some time.
HNSW and DiskANN can be built incrementally so you can start searching them immediately.
Here's a short blog that talks about some hard problems in vector search and how to solve them.
As many have mentioned, DiskANN often outperforms HNSW. HNSW seems to be the standard that most vectorDBs are going with.
https://thenewstack.io/5-hard-problems-in-vector-search-and-...
Re: Ask HN: What is the state of art approximate k-NN search algorithm today?
#13This article does a good job of describing hard problems with ANN search and how different algorithms solve or don't solve. https://dzone.com/articles/5-hard-problems-in-vector-search-...