Tom Lane df700e6b40 Improve tuplesort.c to support variable merge order. The original coding ... with fixed merge order (fixed number of "tapes") was based on obsolete assumptions, namely that tape drives are expensive. Since our "tapes" are really just a couple of buffers, we can have a lot of them given adequate workspace. This allows reduction of the number of merge passes with consequent savings of I/O during large sorts. Simon Riggs with some rework by Tom Lane		2006-02-19 05:54:06 +00:00
..
allpaths.c	Fix qual_is_pushdown_safe to not try to push down quals involving a whole-row	2006-02-13 16:22:23 +00:00
clausesel.c	Add selectivity-calculation code for RowCompareExpr nodes. Simplistic,	2006-01-14 00:14:12 +00:00
costsize.c	Improve tuplesort.c to support variable merge order. The original coding	2006-02-19 05:54:06 +00:00
indxpath.c	Improve my initial, rather hacky implementation of joins to append	2006-02-05 02:59:17 +00:00
joinpath.c	Improve my initial, rather hacky implementation of joins to append	2006-02-05 02:59:17 +00:00
joinrels.c	Teach planner how to rearrange join order for some classes of OUTER JOIN.	2005-12-20 02:30:36 +00:00
Makefile
orindxpath.c	Re-run pgindent, fixing a problem where comment lines after a blank	2005-11-22 18:17:34 +00:00
pathkeys.c	Fix code that checks to see if an index can be considered to match the query's	2006-01-29 17:27:42 +00:00
tidpath.c	Teach tid-scan code to make use of "ctid = ANY (array)" clauses, so that	2005-11-26 22:14:57 +00:00