Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTom Lane2014-01-05 17:28:39 +0000
committerTom Lane2014-01-05 17:28:39 +0000
commit8b49a6044d06b557047210dba2735081bb037e96 (patch)
tree0728628b84691f01663256bceb4e648f3af6a4d6 /contrib/xml2
parent92459e7a7f87f91fc3012bea9eef870cf464d91f (diff)
Cache catalog lookup data across groups in ordered-set aggregates.
The initial commit of ordered-set aggregates just did all the setup work afresh each time the aggregate function is started up. But in a GROUP BY query, the catalog lookups need not be repeated for each group, since the column datatypes and sort information won't change. When there are many small groups, this makes for a useful, though not huge, performance improvement. Per suggestion from Andrew Gierth. Profiling of these cases suggests that it might be profitable to avoid duplicate lookups within tuplesort startup as well; but changing the tuplesort APIs would have much broader impact, so I left that for another day.
Diffstat (limited to 'contrib/xml2')
0 files changed, 0 insertions, 0 deletions