Tom Lane 734308a220 Rearrange make_partitionedrel_pruneinfo to avoid work when we can't prune. ...

Postpone most of the effort of constructing PartitionedRelPruneInfos
until after we have found out whether run-time pruning is needed at all.
This costs very little duplicated effort (basically just an extra
find_base_rel() call per partition) and saves quite a bit when we
can't do run-time pruning.

Also, merge the first loop (for building relid_subpart_map) into
the second loop, since we don't need the map to be valid during
that loop.

Amit Langote

Discussion: https://postgr.es/m/9d7c5112-cb99-6a47-d3be-cf1ee6862a1d@lab.ntt.co.jp

2019-03-22 14:56:12 -04:00

..

Makefile

Move code for managing PartitionDescs into a new file, partdesc.c

2019-02-21 11:45:02 -05:00

partbounds.c

Collations with nondeterministic comparison

2019-03-22 12:12:43 +01:00

partdesc.c

Update copyright year in files added by 1bb5e78218.

2019-03-16 16:00:38 +05:30

partprune.c

Rearrange make_partitionedrel_pruneinfo to avoid work when we can't prune.

2019-03-22 14:56:12 -04:00