diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2010-10-14 16:56:39 -0400 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2010-10-14 16:57:57 -0400 |
| commit | 11cad29c91524aac1d0b61e0ea0357398ab79bf8 (patch) | |
| tree | ec9053dfee621437146f29ce20904a9949b3f2ae /src/backend/executor/execProcnode.c | |
| parent | 30e749dece0e6502d4dd0a3b2892eab61f8c073b (diff) | |
| download | postgresql-11cad29c91524aac1d0b61e0ea0357398ab79bf8.tar.gz postgresql-11cad29c91524aac1d0b61e0ea0357398ab79bf8.zip | |
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.
Diffstat (limited to 'src/backend/executor/execProcnode.c')
| -rw-r--r-- | src/backend/executor/execProcnode.c | 14 |
1 files changed, 14 insertions, 0 deletions
diff --git a/src/backend/executor/execProcnode.c b/src/backend/executor/execProcnode.c index 64cb701e416..edd175e1299 100644 --- a/src/backend/executor/execProcnode.c +++ b/src/backend/executor/execProcnode.c @@ -93,6 +93,7 @@ #include "executor/nodeLimit.h" #include "executor/nodeLockRows.h" #include "executor/nodeMaterial.h" +#include "executor/nodeMergeAppend.h" #include "executor/nodeMergejoin.h" #include "executor/nodeModifyTable.h" #include "executor/nodeNestloop.h" @@ -158,6 +159,11 @@ ExecInitNode(Plan *node, EState *estate, int eflags) estate, eflags); break; + case T_MergeAppend: + result = (PlanState *) ExecInitMergeAppend((MergeAppend *) node, + estate, eflags); + break; + case T_RecursiveUnion: result = (PlanState *) ExecInitRecursiveUnion((RecursiveUnion *) node, estate, eflags); @@ -363,6 +369,10 @@ ExecProcNode(PlanState *node) result = ExecAppend((AppendState *) node); break; + case T_MergeAppendState: + result = ExecMergeAppend((MergeAppendState *) node); + break; + case T_RecursiveUnionState: result = ExecRecursiveUnion((RecursiveUnionState *) node); break; @@ -581,6 +591,10 @@ ExecEndNode(PlanState *node) ExecEndAppend((AppendState *) node); break; + case T_MergeAppendState: + ExecEndMergeAppend((MergeAppendState *) node); + break; + case T_RecursiveUnionState: ExecEndRecursiveUnion((RecursiveUnionState *) node); break; |