Structsยง
- LSH
- Locality Sensitive Hashing (LSH) with random projection. Uses random hyperplanes to hash similar vectors into the same buckets for efficient approximate nearest neighbor search. See https://www.pinecone.io/learn/series/faiss/locality-sensitive-hashing-random-projection/ for details on how LSH works.
- LSHIndex
- LSH Index for document IDs. Stores document IDs in a hashmap of hash values to document IDs. This allows for efficient lookup of document IDs by hash value.