Search Like Light Speed — (2) LSH

In “Search like light speed — (1) HNSW,” we have learned Approximate Nearest Neighbors (ANN) and the graph-based Hierarchy Navigable Small World (HNSW) algorithm. In this post, we will learn the hashing-based Local-Sensitivity Hashing (LSH) algorithm. If you have not heard about hashing — do not worry. I will start with the basics to explain what hashing is and its advantages. I then explain why LSH works in high-dimensional…