milvus-io
/
milvus
mirror of https://github.com/milvus-io/milvus.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

[skip ci]Update proxy name (#13336) 

Signed-off-by: yanliang567 <yanliang.qiao@zilliz.com>
pull/13370/head
yanliang567 2021-12-14 18:43:20 +08:00 committed by GitHub
parent c3f7732f87
commit d7f425a669
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/developer_guides/proxy-reduce.md
View File

@ -10,7 +10,7 @@ Each Search Result is nq * topk two-dimensional structure，as the illustration
For each query, the topk hit results are in descending order of score. The larger the score, the more similar the hit result is to the vector to be queried. The hit results of different queries are independent of each other.
Therefore, we will only discuss how the proxy merges the results for one query result. For nq query results, we can loop through nq or process them in parallel.
Therefore, we will only discuss how Proxy merges the results for one query result. For nq query results, we can loop through nq or process them in parallel.
So the problem degenerates to how to get the maximum number of 10 (TOPK) results from these four sorted arrays. As shown in the figure below:
![final_result](./figs/reduce_results.png)