18min chapter

Software Engineering Daily cover image

MongoDB Vector Search with Ben Flast

Software Engineering Daily

CHAPTER

Efficient Vector Search Techniques

This chapter explores the intricacies of vector search, emphasizing the calculation of distances between vectors using both exact and approximate nearest neighbor approaches. It highlights the innovative use of the Hierarchical Navigable Small Worlds Graph (HNSW) for optimizing searches within large databases like MongoDB, making vector search highly efficient. Additionally, the chapter discusses the growing significance of vector search in AI applications and the integration of traditional and modern search methods for improved performance.

00:00

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