Tom Lane ea166f1146 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.		2000-12-14 22:30:45 +00:00
..
clauses.c	Change SearchSysCache coding conventions so that a reference count is	2000-11-16 22:30:52 +00:00
joininfo.c	Mark functions as static and ifdef NOT_USED as appropriate.	2000-06-08 22:38:00 +00:00
Makefile	Subselects in FROM clause, per ISO syntax: FROM (SELECT ...) [AS] alias.	2000-09-29 18:21:41 +00:00
pathnode.c	Planner speedup hacking. Avoid saving useless pathkeys, so that path	2000-12-14 22:30:45 +00:00
plancat.c	Change SearchSysCache coding conventions so that a reference count is	2000-11-16 22:30:52 +00:00
relnode.c	Restructure handling of inheritance queries so that they work with outer	2000-11-12 00:37:02 +00:00
restrictinfo.c	Subselects in FROM clause, per ISO syntax: FROM (SELECT ...) [AS] alias.	2000-09-29 18:21:41 +00:00
tlist.c	Remove 'func_tlist' from Func expression nodes, likewise 'param_tlist'	2000-08-08 15:43:12 +00:00
var.c	Reimplementation of UNION/INTERSECT/EXCEPT. INTERSECT/EXCEPT now meet the	2000-10-05 19:11:39 +00:00