
ParlayANN with Magdalen Dobson Manohar
Weaviate Podcast
Optimizing Graph Construction Methods
This chapter explores advanced techniques for building large-scale graphs, including adversarial node ordering, distance pruning, and two-hop neighborhoods. It delves into algorithms like pi and N descent, hierarchical clustering, and minimum spanning trees, emphasizing edge diversity and efficiency. The discussion also covers partition-based algorithms, parallel and distributed computing implications, and challenges in disk ANN algorithms.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.