כאשר תוכניות משתנות: פורמליזציה של אופטימיזציה של עלויות-דיוק לחיפושים סמנטיים

תקציר מקורי באנגליתarXiv:2610.08089v2 Announce Type: replace-cross Abstract: In semantic query engines, predicates are evaluated by machine-learned models, and the choice of a query plan affects not only the cost of a query but also its result. Existing systems either apply a fixed threshold to each semantic operator or tune accuracy per operator, without accounting for how errors propagate through joins. We give a formal problem definition for cost-accuracy optimization of such queries. Our starting point is the calibrated confidence that decision models such as Jev attach to each decision. It yields an expected error for every decision; weighting these errors by each decision's contribution to the output (in the simplest case, its fan-out) gives the expected output quality of a plan without any labeled dat