yah01 1a773b8db1
Refine the merge algorithm (#23721)
For given two search tasks t1, t2:
- same topk: merge them if nq1 + nq2 <= MaxNQ
- otherwises: merge them if the merge cost doesn't exceeded merge ratio

the merge cost is defined as:
total cost - min(cost1, cost2)

Signed-off-by: yah01 <yang.cen@zilliz.com>
2023-04-27 09:52:36 +08:00
..
2023-03-31 15:08:23 +08:00
2023-03-31 14:12:23 +08:00
2023-04-25 10:40:34 +08:00
2023-04-25 10:40:34 +08:00
2023-04-25 10:40:34 +08:00
2022-10-27 20:53:32 +08:00
2023-04-25 10:40:34 +08:00
2023-02-09 16:06:33 +08:00
2023-02-09 16:06:33 +08:00
2022-10-27 20:53:32 +08:00
2023-02-09 16:06:33 +08:00
2022-10-25 19:29:36 +08:00
2022-10-27 20:53:32 +08:00
2022-10-27 20:53:32 +08:00