aljaz/turso
1
0
Fork 0
mirror of https://github.com/aljazceru/turso.git synced 2026-02-21 07:55:18 +01:00
Code Issues Packages Projects Releases Wiki Activity

Remove cost_upper_bound_ordered

Browse Source 
It was redundant, as it was always equal to cost_upper_bound.
This commit is contained in:
Piotr Rzysko
2025-08-01 08:24:16 +02:00
parent 718598eab8
commit c80cd370cb
1 changed files with 3 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
core/translate/optimizer/join.rs
View File

@@ -173,7 +173,6 @@ pub fn compute_best_join_order<'a>(
// Keep track of the current best cost so we can short-circuit planning for subplans
// that already exceed the cost of the current best plan.
let cost_upper_bound = best_plan.cost;
let cost_upper_bound_ordered = best_plan.cost;
// Keep track of the best plan for a given subset of tables.
// Consider this example: we have tables a,b,c,d to join.
@@ -202,7 +201,7 @@ pub fn compute_best_join_order<'a>(
&join_order,
maybe_order_target,
access_methods_arena,
cost_upper_bound_ordered,
cost_upper_bound,
)?;
if let Some(rel) = rel {
best_plan_memo.insert(mask, rel);
@@ -317,7 +316,7 @@ pub fn compute_best_join_order<'a>(
&join_order,
maybe_order_target,
access_methods_arena,
cost_upper_bound_ordered,
cost_upper_bound,
)?;
join_order.clear();
@@ -358,7 +357,7 @@ pub fn compute_best_join_order<'a>(
if let Some(rel) = best_ordered_for_mask.take() {
let cost = rel.cost;
let has_all_tables = mask.table_count() == num_tables;
if has_all_tables && cost_upper_bound_ordered > cost {
if has_all_tables && cost_upper_bound > cost {
best_ordered_plan = Some(rel);
}
}