Tom Lane afcf09dd90 Some further performance tweaks for planning large inheritance trees that ... are mostly excluded by constraints: do the CE test a bit earlier to save some adjust_appendrel_attrs() work on excluded children, and arrange to use array indexing rather than rt_fetch() to fetch RTEs in the main body of the planner. The latter is something I'd wanted to do for awhile anyway, but seeing list_nth_cell() as 35% of the runtime gets one's attention.		2007-04-21 21:01:45 +00:00
..
Makefile	Refactor planner's pathkeys data structure to create a separate, explicit	2007-01-20 20:45:41 +00:00
allpaths.c	Some further performance tweaks for planning large inheritance trees that	2007-04-21 21:01:45 +00:00
clausesel.c	Some further performance tweaks for planning large inheritance trees that	2007-04-21 21:01:45 +00:00
costsize.c	Some further performance tweaks for planning large inheritance trees that	2007-04-21 21:01:45 +00:00
equivclass.c	Put back planner's ability to cache the results of mergejoinscansel(),	2007-01-22 20:00:40 +00:00
indxpath.c	Rewrite choose_bitmap_and() to make it more robust in the presence of	2007-04-17 20:03:03 +00:00
joinpath.c	Refactor planner's pathkeys data structure to create a separate, explicit	2007-01-20 20:45:41 +00:00
joinrels.c	Restructure code that is responsible for ensuring that clauseless joins are	2007-02-16 00:14:01 +00:00
orindxpath.c	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00
pathkeys.c	Avoid running build_index_pathkeys() in situations where there cannot	2007-04-15 20:09:28 +00:00
tidpath.c	Update CVS HEAD for 2007 copyright. Back branches are typically not	2007-01-05 22:20:05 +00:00