diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2000-12-14 22:30:45 +0000 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2000-12-14 22:30:45 +0000 |
| commit | ea166f11462c863d91378fcbb15d4d3140002413 (patch) | |
| tree | ef157dad5b07081aae231ab9691f2ef2d5b625a4 /src/test/regress/expected/join.out | |
| parent | db11f4382abad09d42e784c1fa19dfbcd68038ac (diff) | |
| download | postgresql-ea166f11462c863d91378fcbb15d4d3140002413.tar.gz | |
Planner speedup hacking. Avoid saving useless pathkeys, so that path
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.
Diffstat (limited to 'src/test/regress/expected/join.out')
| -rw-r--r-- | src/test/regress/expected/join.out | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/test/regress/expected/join.out b/src/test/regress/expected/join.out index 53a7ef4930..6774390046 100644 --- a/src/test/regress/expected/join.out +++ b/src/test/regress/expected/join.out @@ -1796,13 +1796,13 @@ SELECT '' AS "xxx", * | 4 | 1 | four | | 5 | 0 | five | -5 | 5 | 0 | five | -5 - | | | | - | | | | 0 | 6 | 6 | six | | 7 | 7 | seven | | 8 | 8 | eight | | | | null | | | 0 | zero | + | | | | + | | | | 0 (15 rows) SELECT '' AS "xxx", * @@ -1817,13 +1817,13 @@ SELECT '' AS "xxx", * | 4 | 1 | four | | 5 | 0 | five | -5 | 5 | 0 | five | -5 - | | | | - | | | | 0 | 6 | 6 | six | | 7 | 7 | seven | | 8 | 8 | eight | | | | null | | | 0 | zero | + | | | | + | | | | 0 (15 rows) SELECT '' AS "xxx", * |