ScaNN (Scalable Nearest Neighbors) is a method for efficient vector similarity search at scale. This is a simplified version of ScaNN that requires less resources to run and only for inference. There's no support for K-Means partitioning training and quantization training. It supports retrieval with the following features:
- K-Means tree space partitioning.
- Asymmetric Hashing (AH) quantization.
dot_product
andsquared_l2
distance measures. Note that fordot_product
distance, we return the negative dot product. This is to ensure consistency withsquared_l2
that smaller means closer.- Indexing new embeddings, including assigning them to closest partitions and AH quantize them.