aboutsummaryrefslogtreecommitdiff
path: root/src/backend/executor/nodeIncrementalSort.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/backend/executor/nodeIncrementalSort.c')
-rw-r--r--src/backend/executor/nodeIncrementalSort.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/backend/executor/nodeIncrementalSort.c b/src/backend/executor/nodeIncrementalSort.c
index e056469448c..6c0d24ee25a 100644
--- a/src/backend/executor/nodeIncrementalSort.c
+++ b/src/backend/executor/nodeIncrementalSort.c
@@ -65,8 +65,8 @@
* into the second mode if we believe it's beneficial.
*
* Sorting incrementally can potentially use less memory, avoid fetching
- * and sorting all tuples in the the dataset, and begin returning tuples
- * before the entire result set is available.
+ * and sorting all tuples in the dataset, and begin returning tuples before
+ * the entire result set is available.
*
* The hybrid mode approach allows us to optimize for both very small
* groups (where the overhead of a new tuplesort is high) and very large