Practice
Learn
← Quit
0 / 0 correct
LLMs & AI
Hard
1 of 190
How do approximate nearest neighbour (ANN) indexes like HNSW make vector search fast?
A
They navigate a layered proximity graph toward the query, examining a small fraction of vectors, trading a little recall for large speedups
B
They compare the query with every vector exactly
C
They sort vectors alphabetically
D
They hash vectors so collisions are exact matches