The exact nearest neighbor search has like n squared complexity. Each time you add a new vector and you want to query it to find out what the nearest neighbors are, you need to perform an n squared calculation. The issue of course is that quadratic growth is really bad. And this is where approximate nearest neighbor comes in. It's just one matrix multiplication and that's very fast.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode