diff options
| author | Robert Haas | 2016-04-08 06:36:26 +0000 |
|---|---|---|
| committer | Robert Haas | 2016-04-08 06:36:26 +0000 |
| commit | 0711803775a37e0bf39d7efdd1e34d9d7e640ea1 (patch) | |
| tree | 8f9e68f32ace8aa5ca7520f7589aca419266b0ce /src/include | |
| parent | 719c84c1be51f3d3fe6049b77ddbaa0c4b58a9a9 (diff) | |
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.
Diffstat (limited to 'src/include')
| -rw-r--r-- | src/include/miscadmin.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/include/miscadmin.h b/src/include/miscadmin.h index 9200f045a2..356fcc6eda 100644 --- a/src/include/miscadmin.h +++ b/src/include/miscadmin.h @@ -239,6 +239,7 @@ extern bool enableFsync; extern bool allowSystemTableMods; extern PGDLLIMPORT int work_mem; extern PGDLLIMPORT int maintenance_work_mem; +extern PGDLLIMPORT int replacement_sort_tuples; extern int VacuumCostPageHit; extern int VacuumCostPageMiss; |