Skip to content

perf(query): gate the bounded-multikey count+take fast path by table size #233

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
singaraiona merged 1 commit into from
Jun 8, 2026
+9 −0
Merged

perf(query): gate the bounded-multikey count+take fast path by table size #233

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions src/ops/query.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5371,7 +5371,16 @@ ray_t* ray_select(ray_t** args, int64_t n) {
break;
}
}
/* The bounded-multikey count-take candidate uses an
* eval-level single-threaded scan with O(found) per-row
* group lookup. Profitable on small inputs (skips the
* full DAG group HT construction) but at 10M rows × multi-
* key composite (ClickBench q17), the serial scan loses
* to the parallel mk_par_v2 filtered_group below. Gate
* on table size — let big inputs through to the fused
* multi-key path. */
if (!use_eval_group &&
ray_table_nrows(tbl) < 100000 &&
bounded_multikey_count_take_candidate(
dict_elems, dict_n, from_id, where_id, by_id, take_id,
asc_id, desc_id, ray_table_nrows(tbl), 1024)) {
Expand Down
Loading