3 ms·

What algorithms are these databases using for fast similarity search? Are they guaranteed to return the most optimal similar neighbors or will they be sloppy i

• fzliu 4y ago
  One key differentiator of Milvus is the ability to use a variety of different indexing algorithms. Some will consume very little memory and provide significant speedup at the expense of recall, while others are more powerful at the expensive of compute time or memory consumption. The most commonly used one I've seen is HNSW, which greatly speeds up search at the expensive of some extra memory consumption. Recall is also strong - for many large-scale use cases you can get 95%+ with properly tuned parameters.