mirror of
https://git.postgresql.org/git/postgresql.git
synced 2024-09-08 20:49:20 +02:00
Fix things so that top-N sorting can be used in child Sort nodes of a MergeAppend node, when there is a LIMIT and no intervening joins or grouping. Actually doing this on the executor side isn't too bad, but it's a bit messier to get the planner to cost it properly. Per gripe from Robert Haas. In passing, fix an oversight in the original top-N-sorting patch: query_planner should not assume that a LIMIT can be used to make an explicit sort cheaper when there will be grouping or aggregation in between. Possibly this should be back-patched, but I'm not sure the mistake is serious enough to be a real problem in practice. |
||
---|---|---|
.. | ||
bitmapset.h | ||
execnodes.h | ||
makefuncs.h | ||
memnodes.h | ||
nodeFuncs.h | ||
nodes.h | ||
params.h | ||
parsenodes.h | ||
pg_list.h | ||
plannodes.h | ||
primnodes.h | ||
print.h | ||
readfuncs.h | ||
relation.h | ||
tidbitmap.h | ||
value.h |