4 ms·

What exactly is elegant about this algorithm? The approach seems computationally quite inefficient to me.

• zX41ZdbW 3y ago
  It is inefficient to build (unless on GPU), but good for search. Moreover, the search naturally benefits from data locality after ordering - this allows using MergeTree tables in ClickHouse. See https://news.ycombinator.com/item?id=36341754 https://news.ycombinator.com/item?id=36341754 And it is around 10 lines of code in SQL: https://presentations.clickhouse.com/meetup74/ai/#35 https://presentations.clickhouse.com/meetup74/ai/#35
  • gavinray 3y ago
    That presentation was pretty cool, thanks for posting.
  • irwt 3y ago
    That's the thing though, it's very easy to perform approximate nearest neighbor search in an efficient way. There are plenty of simple solutions for that. The real challenge is to design an algorithm that can scale & that remains robust even when there are additions and deletions to the set.