duckdb 0.5.2-dev648.0 → 0.5.2-dev650.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/package.json +1 -1
- package/src/duckdb.cpp +8 -0
- package/src/duckdb.hpp +2 -2
- package/src/parquet-amalgamation.cpp +37836 -37836
package/package.json
CHANGED
package/src/duckdb.cpp
CHANGED
|
@@ -148719,6 +148719,9 @@ unique_ptr<JoinNode> JoinOrderOptimizer::CreateJoinTree(JoinRelationSet *set,
|
|
|
148719
148719
|
return CreateJoinTree(set, possible_connections, right, left);
|
|
148720
148720
|
}
|
|
148721
148721
|
if (plan != plans.end()) {
|
|
148722
|
+
if (!plan->second) {
|
|
148723
|
+
throw InternalException("No plan: internal error in join order optimizer");
|
|
148724
|
+
}
|
|
148722
148725
|
expected_cardinality = plan->second->GetCardinality();
|
|
148723
148726
|
best_connection = possible_connections.back();
|
|
148724
148727
|
} else if (possible_connections.empty()) {
|
|
@@ -148755,6 +148758,9 @@ JoinNode *JoinOrderOptimizer::EmitPair(JoinRelationSet *left, JoinRelationSet *r
|
|
|
148755
148758
|
// get the left and right join plans
|
|
148756
148759
|
auto &left_plan = plans[left];
|
|
148757
148760
|
auto &right_plan = plans[right];
|
|
148761
|
+
if (!left_plan || !right_plan) {
|
|
148762
|
+
throw InternalException("No left or right plan: internal error in join order optimizer");
|
|
148763
|
+
}
|
|
148758
148764
|
auto new_set = set_manager.Union(left, right);
|
|
148759
148765
|
// create the join tree based on combining the two plans
|
|
148760
148766
|
auto new_plan = CreateJoinTree(new_set, info, left_plan.get(), right_plan.get());
|
|
@@ -148787,6 +148793,7 @@ JoinNode *JoinOrderOptimizer::EmitPair(JoinRelationSet *left, JoinRelationSet *r
|
|
|
148787
148793
|
}
|
|
148788
148794
|
}
|
|
148789
148795
|
|
|
148796
|
+
D_ASSERT(new_plan);
|
|
148790
148797
|
plans[new_set] = move(new_plan);
|
|
148791
148798
|
return result;
|
|
148792
148799
|
}
|
|
@@ -149437,6 +149444,7 @@ unique_ptr<LogicalOperator> JoinOrderOptimizer::Optimize(unique_ptr<LogicalOpera
|
|
|
149437
149444
|
cardinality_estimator.InitCardinalityEstimatorProps(&nodes_ops, &filter_infos);
|
|
149438
149445
|
|
|
149439
149446
|
for (auto &node_op : nodes_ops) {
|
|
149447
|
+
D_ASSERT(node_op.node);
|
|
149440
149448
|
plans[node_op.node->set] = move(node_op.node);
|
|
149441
149449
|
}
|
|
149442
149450
|
// now we perform the actual dynamic programming to compute the final result
|
package/src/duckdb.hpp
CHANGED
|
@@ -11,8 +11,8 @@ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLI
|
|
|
11
11
|
#pragma once
|
|
12
12
|
#define DUCKDB_AMALGAMATION 1
|
|
13
13
|
#define DUCKDB_AMALGAMATION_EXTENDED 1
|
|
14
|
-
#define DUCKDB_SOURCE_ID "
|
|
15
|
-
#define DUCKDB_VERSION "v0.5.2-
|
|
14
|
+
#define DUCKDB_SOURCE_ID "9b1e6ec64"
|
|
15
|
+
#define DUCKDB_VERSION "v0.5.2-dev650"
|
|
16
16
|
//===----------------------------------------------------------------------===//
|
|
17
17
|
// DuckDB
|
|
18
18
|
//
|