A company stores AI training datasets in a relational database. Which indexing strategy best accelerates similarity searches on high-dimensional embedding vectors?
-
A
B-tree index on the embedding column
-
B
Approximate Nearest Neighbor (ANN) index such as HNSW
-
C
Full-text search index on serialized vectors
-
D
Composite primary key across all vector dimensions