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-04-25 10:40:34 +08:00
2023-04-10 10:18:29 +08:00
2022-03-17 17:17:22 +08:00
2023-01-06 10:59:35 +08:00
2023-03-27 22:36:01 +08:00
2023-01-06 16:57:36 +08:00
2022-08-11 12:12:38 +08:00
2022-08-26 19:22:56 +08:00
2023-03-24 17:49:59 +08:00
2022-01-04 09:09:22 +08:00
2023-02-24 17:51:47 +08:00
2023-02-08 10:08:32 +08:00
2023-02-09 16:06:33 +08:00
2023-04-27 09:52:36 +08:00
2023-01-18 11:47:43 +08:00
2022-10-17 20:05:26 +08:00
2023-03-01 11:31:48 +08:00
2023-04-10 17:50:30 +08:00
2023-03-14 14:03:58 +08:00
2023-03-24 17:49:59 +08:00
2023-03-27 22:36:01 +08:00
2023-03-24 17:49:59 +08:00
2023-03-24 17:49:59 +08:00
2022-10-31 13:55:33 +08:00
2022-08-23 10:44:52 +08:00
2022-11-24 10:51:12 +08:00
2022-10-25 19:39:30 +08:00
2022-01-06 13:13:51 +08:00
2023-04-18 10:28:32 +08:00
2023-04-27 09:52:36 +08:00
2022-10-31 20:59:34 +08:00
2023-02-24 17:51:47 +08:00
2023-03-30 10:52:22 +08:00
2023-04-11 15:54:29 +08:00
2022-12-12 15:23:22 +08:00
2022-01-10 13:05:20 +08:00
2022-11-15 19:41:16 +08:00
2023-04-26 10:24:35 +08:00
2022-01-06 14:53:20 +08:00
2023-04-25 18:06:40 +08:00
2021-11-16 15:41:11 +08:00
1a773b8db1