From cb13710e09f1fe30fa9f77d33821a0931421efc2 Mon Sep 17 00:00:00 2001 From: yanliang567 <82361606+yanliang567@users.noreply.github.com> Date: Wed, 22 Dec 2021 15:03:08 +0800 Subject: [PATCH] [skip e2e]Update typo issues (#13959) Signed-off-by: yanliang567 --- docs/developer_guides/proxy-reduce.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/docs/developer_guides/proxy-reduce.md b/docs/developer_guides/proxy-reduce.md index f9b666a452..e495a0c7e1 100644 --- a/docs/developer_guides/proxy-reduce.md +++ b/docs/developer_guides/proxy-reduce.md @@ -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