Similarity Search, Quantization, Faiss, Machine Learning, Hands On Tutorials.
PQ codes) and the partial distance d[i][j] from that centroid to the query subvector i (by using the calculated matrix d) is taken. All the partial distances are squared and summed up. By taking the square root of this value, the approximate euclidean distance is obtained. If you want to know how