ANN算法总结

• kd-tree

  kd-tree works poorly in high dimensions (k<30) 本身实验的时候差很少20到30左右吧，超过以后，就真的很慢了

• faiss

  support high-dimensional vectors of 50 to 1000+ dimensions use gpu

   

• annoy

  Works better if you don't have too many dimensions (like <100) but seems to perform surprisingly well even up to 1,000 dimensions