graph based approximate nearest neighbor search (granne)
Tags: approximate nearest neighbor, algorithms
-
Stores adjacency lists with a variable number of neighbors per node
- saves space on metadata
- size of index structure depends on the properties of the graph
- usable index of 4 bil vectors at 240GB
- can actually use mmap to map the index and the query vectors for lazy loading
-
Data locality can be increased on the SSD by ordering elements with closer HNSW nodes