• T
    Planner speedup hacking. Avoid saving useless pathkeys, so that path · ea166f11
    Tom Lane 提交于
    comparison does not consider paths different when they differ only in
    uninteresting aspects of sort order.  (We had a special case of this
    consideration for indexscans already, but generalize it to apply to
    ordered join paths too.)  Be stricter about what is a canonical pathkey
    to allow faster pathkey comparison.  Cache canonical pathkeys and
    dispersion stats for left and right sides of a RestrictInfo's clause,
    to avoid repeated computation.  Total speedup will depend on number of
    tables in a query, but I see about 4x speedup of planning phase for
    a sample seven-table query.
    ea166f11
prepunion.c 20.2 KB