Re:The Missing ”WHERE” Clause for Vector Search
by WithinReason on Monday September 27, 2021 @11:24AM
(#28671790)
And how do construct a search that can stream results in descending order of similarity, that's faster than O(N) for N values in the database?
[ Parent
| on HN ]
Re:The Missing ”WHERE” Clause for Vector Search
by mnw21cam on Monday September 27, 2021 @11:41AM
(#28672056)
That's a fairly standard nearest neighbour search[0], usually made fast by using a kd-tree[1] or an R-tree[2].
[0] https://en.wikipedia.org/wiki/Nearest_neighbor_search
[1] https://en.wikipedia.org/wiki/K-d_tree
[2] https://en.wikipedia.org/wiki/R-tree