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

[skip e2e]Update typo issues (#13959) 

Signed-off-by: yanliang567 <yanliang.qiao@zilliz.com>
pull/14018/head
yanliang567 2021-12-22 15:03:08 +08:00 committed by GitHub
parent 1167bd78a6
commit cb13710e09
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -2,9 +2,9 @@
## Search Results Organized format
For a specified Search request, with nq = 2 and topk = 10, Proxy received 4 search results from query nodes.
For a specified Search request, with nq = 2 and topk = 10, Proxy receives 4 search results from query nodes.
Each Search Result is nq * topk two-dimensional structure，as the illustration below. The result indicates that the user has input nq vectors and wants to obtain the topk similar vectors to these nq vectors respectively.
Each Search Result is nq * topk two-dimensional structure，as the illustration below. The result indicates that the user input nq vectors and wanted to obtain the topk similar vectors to these nq vectors respectively.
![search_result_format](./figs/nq_topk_search_results.png)
@ -12,7 +12,7 @@ For each query, the topk hit results are in descending order of score. The large
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:
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)
## K-Way Merge Algorithm