Implementation of hierarchical navigable small world (hnsw) search techniques using nand memory
AssigneeSanDisk Technologies LLC
InventorsChao Sun, Muqing Liu, Cyril Guyot
Life of this patent
Estimating the term…
Loading patent…
AssigneeSanDisk Technologies LLC
InventorsChao Sun, Muqing Liu, Cyril Guyot
Estimating the term…
To accelerate search speeds for approximate nearest neighbor searches of vector databases, compute-in-memory techniques using NAND memory structures are introduced. For each element of the database, a kernel of its M nearest neighbors is determined. For each vector of the database, both the vector and its kernel are programmed in the arrays of a NAND memory based accelerator card, so that the vectors will be written into the memory arrays both as themselves and also in kernels of vectors for which they are a nearest neighbor. Metadata, associating the locations of the kernel members with the correspond vector is also stored in the memory system. After determining the input's nearest neighbor at one level of search, the metadata is then used to locate that nearest neighbor's nearest neighbors and their distances to the input vector are then computed in parallel in a compute-in-memory vector-vector dot product multiplication.
A non-volatile memory device, comprising:
A method, comprising:
A memory system, comprising:
Dependencies are inferred from the claim text.