The New Stack Podcast cover image

Why Developers Need Vector Search

The New Stack Podcast

00:00

HNSW: A Graph Based Algorithm for Nearest Neighbor Search

HNSW is a graph based algorithm for nearest neighbor search. It works with any distance space, so it doesn't have to be vectors. And it can scale with logarithmic complexity if the data has a slow and multimensionality. HNSW is probably the most commonly used indexing strategy for vectors today.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app