From: | tgl(at)postgresql(dot)org |
---|---|
To: | pgsql-committers(at)postgresql(dot)org |
Subject: | pgsql/src/backend/optimizer/util (pathnode.c) |
Date: | 2000-12-14 22:30:44 |
Message-ID: | 200012142230.eBEMUi878459@hub.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-committers |
Date: Thursday, December 14, 2000 @ 17:30:44
Author: tgl
Update of /home/projects/pgsql/cvsroot/pgsql/src/backend/optimizer/util
from hub.org:/home/projects/pgsql/tmp/cvs-serv78433/src/backend/optimizer/util
Modified Files:
pathnode.c
----------------------------- Log Message -----------------------------
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.
From | Date | Subject | |
---|---|---|---|
Next Message | tgl | 2000-12-14 22:30:45 | pgsql/src/include/nodes (relation.h) |
Previous Message | tgl | 2000-12-14 22:30:43 | pgsql/src/backend/optimizer/path (allpaths.c indxpath.c joinpath.c pathkeys.c) |