Weaviate Podcast cover image

ParlayANN with Magdalen Dobson Manohar

Weaviate Podcast

CHAPTER

Exploring Filtered Search Algorithms and Challenges in Nearest Neighbor Science

The chapter delves into the complexities of filtered search algorithms, focusing on IVF squared and Acorn as solutions to handling filters and proximity queries in nearest neighbor science. Discussions include challenges in supporting arbitrary filters, dynamic index thinking, and graph-based algorithms for out-of-distribution data. The speakers also touch on future research interests in dynamic graph-based algorithms and the concept of concurrent S graph computing for minimizing latency in query processing.

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.
App store bannerPlay store banner