You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
Optimizer: cost candidates per (sketch_type, params) via sketch-bench's atomic-cost table #549
greedy_assign resolves AtomicCosts per candidate instead of applying one flat cost to every candidate in a run:
CMS/HLL/KLL candidates look up sketch-bench's exported atomic-cost table by exact (sketch, params) key — matches candidate_gen.rs's param grid exactly, no interpolation.
Every other AggregationType (Sum, MinMax, CountMinSketchWithHeap, Hydra, ...) keeps the existing flat stub (AtomicCosts::default()), logged with a warning so the fallback is visible rather than silent.
The table loads at runtime from a file path (--atomic-costs on optimizer_cli and candidate-gen-dump), not compiled in. The loader is a trivial deserialize — no raw-record math on the ASAPQuery side.
candidate-gen-dump --atomic-costs <path> prints each candidate's resolved cost, labeled [real]/[stub], for auditing.
Deliberately not in scope here (tracked on #524 instead):
CountMinSketchWithHeap's analytic memory bound (heap_size · avg_key_size) — still rides the flat stub.
Activity
docs(optimizer): document atomic_costs.rs and the --atomic-costs work…
feat(planner): cost candidates per (sketch_type, params) from sketch-…