Weaviate Podcast cover image

Weaviate Podcast

ParlayANN with Magdalen Dobson Manohar

Apr 24, 2024
Join Magdalen Dobson Manohar, a brilliant scientist, on a journey into Approximate Nearest Neighbor Search. Explore topics like Parallel Computing, Lock Contention in HNSW, ParlayANN development, Filtered Vector Search, and exciting future directions in Vector Search technology.
01:03:57

Podcast summary created with Snipd AI

Quick takeaways

  • ParlayANN explores parallel indexing without locking, offering a unique approach in vector database technology.
  • Prefix doubling enables edge insertion in graph-based algorithms, maintaining performance while handling large-scale computations.

Deep dives

Explanation of Graph-Based Algorithms for Approximate Nearest Neighbor Search

Graph-based algorithms for approximate nearest neighbor search involve methods like disk ANN and HSNW that focus on building graph structures efficiently. These algorithms address challenges such as data races when adding edges to existing vertices. The process includes determining out neighbors and then adding reverse edges, ensuring degrees are bound within the graph.

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