test/milvus
1
0
Fork 0
mirror of https://gitee.com/milvus-io/milvus.git synced 2024-12-01 19:39:21 +08:00
Code Issues Actions 12 Packages Projects Releases Wiki Activity

[skip ci] Fix grammar (#13106)

Browse Source 
Signed-off-by: Bennu <yunmei.li@zilliz.com>
This commit is contained in:
Bennu 2021-12-09 19:49:07 +08:00 committed by GitHub
parent a2464c860b
commit 983ee423f3
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

@ -44,7 +44,7 @@ for i -> topk:
This algorithm is originated from the merging phase of merge sort. The common point of the two is that the results have been sorted when merging, and the difference is that merge sort merges two-way results, proxy reduces merges multiple results.
In contrast, in merge sort, two pointers are used to record the offsets of the two-way results, and proxy reduce uses multiple pointers `locs` to record the offsets of the `k-way` results.
In contrast, in merge sort, two pointers are used to record the offsets of the two-way results, and proxy reduces uses multiple pointers `locs` to record the offsets of the `k-way` results.
In our specific situation, n indicates that there are 4 results to be merged, `multiple_results` is an array of four `topk`, and each `choiceOffset` in `locs` records the offset of each way being merged.