Robert Haas 0711803775 Use quicksort, not replacement selection, for external sorting. ... We still use replacement selection for the first run of the sort only and only when the number of tuples is relatively small. Otherwise, the first run, and subsequent runs in all cases, are produced using quicksort. This tends to be faster except perhaps for very small amounts of working memory. Peter Geoghegan, reviewed by Tomas Vondra, Jeff Janes, Mithun Cy, Greg Stark, and me.		2016-04-08 02:36:26 -04:00
..
allpaths.c	Support using index-only scans with partial indexes in more cases.	2016-03-31 14:49:10 -04:00
clausesel.c	Update copyright for 2016	2016-01-02 13:33:40 -05:00
costsize.c	Use quicksort, not replacement selection, for external sorting.	2016-04-08 02:36:26 -04:00
equivclass.c	Give pull_var_clause() reject/recurse/return behavior for WindowFuncs too.	2016-03-10 16:23:52 -05:00
indxpath.c	Support using index-only scans with partial indexes in more cases.	2016-03-31 14:49:10 -04:00
joinpath.c	Run pgindent on a batch of (mostly-planner-related) source files.	2016-04-06 11:34:02 -04:00
joinrels.c	Support parallel joins, and make related improvements.	2016-01-20 14:40:26 -05:00
Makefile	Extract restriction OR clauses whether or not they are indexable.	2013-12-30 12:24:37 -05:00
pathkeys.c	Make the upper part of the planner work by generating and comparing Paths.	2016-03-07 15:58:22 -05:00
tidpath.c	Update copyright for 2016	2016-01-02 13:33:40 -05:00