You're actually comparing a data structure (KD trees) to a library (scann and faiss). HNSW is the data structure that is commonly used by vector search database

You're actually comparing a data structure (KD trees) to a library (scann and faiss). HNSW is the data structure that is commonly used by vector search databases. If we're in the Rust world, Qdrant is a great example here.