3 ms·
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?
by WithinReason 5y ago
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?
- mnw21cam 5y agoThat'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