From a31ad27fc5dc32a1453233575b3cf7b5c34cf515 Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Thu, 9 Jun 2005 04:19:00 +0000 Subject: Simplify the planner's join clause management by storing join clauses of a relation in a flat 'joininfo' list. The former arrangement grouped the join clauses according to the set of unjoined relids used in each; however, profiling on test cases involving lots of joins proves that that data structure is a net loss. It takes more time to group the join clauses together than is saved by avoiding duplicate tests later. It doesn't help any that there are usually not more than one or two clauses per group ... --- src/include/nodes/nodes.h | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) (limited to 'src/include/nodes/nodes.h') diff --git a/src/include/nodes/nodes.h b/src/include/nodes/nodes.h index 326e929d76f..d9c98321ea3 100644 --- a/src/include/nodes/nodes.h +++ b/src/include/nodes/nodes.h @@ -7,7 +7,7 @@ * Portions Copyright (c) 1996-2005, PostgreSQL Global Development Group * Portions Copyright (c) 1994, Regents of the University of California * - * $PostgreSQL: pgsql/src/include/nodes/nodes.h,v 1.169 2005/06/05 22:32:57 tgl Exp $ + * $PostgreSQL: pgsql/src/include/nodes/nodes.h,v 1.170 2005/06/09 04:19:00 tgl Exp $ * *------------------------------------------------------------------------- */ @@ -183,7 +183,6 @@ typedef enum NodeTag T_UniquePath, T_PathKeyItem, T_RestrictInfo, - T_JoinInfo, T_InnerIndexscanInfo, T_InClauseInfo, -- cgit v1.2.3