From 11cad29c91524aac1d0b61e0ea0357398ab79bf8 Mon Sep 17 00:00:00 2001 From: Tom Lane Date: Thu, 14 Oct 2010 16:56:39 -0400 Subject: Support MergeAppend plans, to allow sorted output from append relations. This patch eliminates the former need to sort the output of an Append scan when an ordered scan of an inheritance tree is wanted. This should be particularly useful for fast-start cases such as queries with LIMIT. Original patch by Greg Stark, with further hacking by Hans-Jurgen Schonig, Robert Haas, and Tom Lane. --- src/include/nodes/nodes.h | 3 +++ 1 file changed, 3 insertions(+) (limited to 'src/include/nodes/nodes.h') diff --git a/src/include/nodes/nodes.h b/src/include/nodes/nodes.h index 0d33a2ed5f..15dabe31ce 100644 --- a/src/include/nodes/nodes.h +++ b/src/include/nodes/nodes.h @@ -45,6 +45,7 @@ typedef enum NodeTag T_Result, T_ModifyTable, T_Append, + T_MergeAppend, T_RecursiveUnion, T_BitmapAnd, T_BitmapOr, @@ -87,6 +88,7 @@ typedef enum NodeTag T_ResultState, T_ModifyTableState, T_AppendState, + T_MergeAppendState, T_RecursiveUnionState, T_BitmapAndState, T_BitmapOrState, @@ -215,6 +217,7 @@ typedef enum NodeTag T_HashPath, T_TidPath, T_AppendPath, + T_MergeAppendPath, T_ResultPath, T_MaterialPath, T_UniquePath, -- cgit v1.2.1