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] Fix typo in proxy reduce developer guide (#11578) 

Signed-off-by: Edward Zeng <jie.zeng@zilliz.com>
pull/11590/head
edward.zeng 2021-11-10 20:13:31 +08:00 committed by GitHub
parent 14d2891a69
commit c05f4ed997
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -17,7 +17,7 @@ So the problem degenerates to how to get the maximum number of 10 (TOPK) results
## K-Way Merge Algorithm
Pesudocode of this algorithm is shown below:
Pseudocode of this algorithm is shown below:
```golang
n = 4
@ -52,4 +52,4 @@ The `score_this_way` corresponding to this offset records the maximum value of t
This ensures that the result we take each time is the largest among the remaining results.
This algorithm will scan all Search Results linearly at most, hence the time complexity of this algorithm is n \* topk.
This algorithm will scan all Search Results linearly at most, hence the time complexity of this algorithm is n \* topk.