ANNOY is essentially a binary space partition tree for points without having to ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		AtlasBarfed on Jan 12, 2024 \| parent \| context \| favorite \| on: Vector Databases: A Technical Primer [pdf] ANNOY is essentially a binary space partition tree for points without having to worry about sets of points aka polygons?

fzliu on Jan 12, 2024 [–]

Like IVF, Annoy partitions the entire embedding space into high-dimensional polygons. The difference is how the two algorithms do it - IVF (https://zilliz.com/learn/vector-index) uses centroids, while Annoy (https://zilliz.com/learn/approximate-nearest-neighbor-oh-yea...) is basically just one big binary tree.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact