duckdb 0.6.2-dev490.0 → 0.6.2-dev499.0

package/package.json

@@ -2,7 +2,7 @@
   "name": "duckdb",
   "main": "./lib/duckdb.js",
   "types": "./lib/duckdb.d.ts",
-  "version": "0.6.2-dev490.0",
+  "version": "0.6.2-dev499.0",
   "description": "DuckDB node.js API",
   "gypfile": true,
   "dependencies": {

package/src/duckdb.cpp

@@ -156976,6 +156976,7 @@ private:
 	void UpdateDPTree(JoinNode *new_plan);
 
 	void UpdateJoinNodesInFullPlan(JoinNode *node);
+	bool NodeInFullPlan(JoinNode *node);
 
 	std::pair<JoinRelationSet *, unique_ptr<LogicalOperator>>
 	GenerateJoins(vector<unique_ptr<LogicalOperator>> &extracted_relations, JoinNode *node);
@@ -157706,7 +157707,6 @@ string JoinNode::ToString() {
 
 
 
-
 #include <algorithm>
 
 namespace std {
@@ -157975,6 +157975,10 @@ unique_ptr<JoinNode> JoinOrderOptimizer::CreateJoinTree(JoinRelationSet *set,
 	return result;
 }
 
+bool JoinOrderOptimizer::NodeInFullPlan(JoinNode *node) {
+	return join_nodes_in_full_plan.find(node->set->ToString()) != join_nodes_in_full_plan.end();
+}
+
 void JoinOrderOptimizer::UpdateJoinNodesInFullPlan(JoinNode *node) {
 	if (!node) {
 		return;
@@ -158205,7 +158209,7 @@ static vector<unordered_set<idx_t>> AddSuperSets(vector<unordered_set<idx_t>> cu
 }
 
 // works by first creating all sets with cardinality 1
-// then iterates over each previously create group of subsets and will only add a neighbor if the neighbor
+// then iterates over each previously created group of subsets and will only add a neighbor if the neighbor
 // is greater than all relations in the set.
 static vector<unordered_set<idx_t>> GetAllNeighborSets(JoinRelationSet *new_set, unordered_set<idx_t> &exclusion_set,
                                                        vector<idx_t> neighbors) {
@@ -158241,6 +158245,11 @@ static vector<unordered_set<idx_t>> GetAllNeighborSets(JoinRelationSet *new_set,
 }
 
 void JoinOrderOptimizer::UpdateDPTree(JoinNode *new_plan) {
+	if (!NodeInFullPlan(new_plan)) {
+		// if the new node is not in the full plan, feel free to return
+		// because you won't be updating the full plan.
+		return;
+	}
 	auto new_set = new_plan->set;
 	// now update every plan that uses this plan
 	unordered_set<idx_t> exclusion_set;
@@ -158302,6 +158311,7 @@ void JoinOrderOptimizer::SolveJoinOrderApproximately() {
 					// update the DP tree in case a plan created by the DP algorithm uses the node
 					// that was potentially just updated by EmitPair. You will get a use-after-free
 					// error if future plans rely on the old node that was just replaced.
+					// if node in FullPath, then updateDP tree.
 					UpdateDPTree(node);
 
 					if (!best_connection || node->GetCost() < best_connection->GetCost()) {

package/src/duckdb.hpp

@@ -11,8 +11,8 @@ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLI
 #pragma once
 #define DUCKDB_AMALGAMATION 1
 #define DUCKDB_AMALGAMATION_EXTENDED 1
-#define DUCKDB_SOURCE_ID "f6311a30e6"
-#define DUCKDB_VERSION "v0.6.2-dev490"
+#define DUCKDB_SOURCE_ID "bb5cb7f51e"
+#define DUCKDB_VERSION "v0.6.2-dev499"
 //===----------------------------------------------------------------------===//
 //                         DuckDB
 //