aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAlexander Korotkov <akorotkov@postgresql.org>2024-01-21 23:26:41 +0200
committerAlexander Korotkov <akorotkov@postgresql.org>2024-01-21 23:27:29 +0200
commitc03d91d9be378975bcdbfa3e5d40e17288e6f13f (patch)
treef6f565142c8f43f7b71405b1f572c942ec48d974
parent0452b461bc405e6d35d8a14c02813c15e28ae516 (diff)
downloadpostgresql-c03d91d9be378975bcdbfa3e5d40e17288e6f13f.tar.gz
postgresql-c03d91d9be378975bcdbfa3e5d40e17288e6f13f.zip
Fix table name collision in tests in 0452b461bc
-rw-r--r--src/test/regress/expected/aggregates.out16
-rw-r--r--src/test/regress/sql/aggregates.sql8
2 files changed, 12 insertions, 12 deletions
diff --git a/src/test/regress/expected/aggregates.out b/src/test/regress/expected/aggregates.out
index 67dd20f3751..ac42b94ef10 100644
--- a/src/test/regress/expected/aggregates.out
+++ b/src/test/regress/expected/aggregates.out
@@ -2876,26 +2876,26 @@ RESET enable_incremental_sort;
DROP TABLE btg;
-- The case, when scanning sort order correspond to aggregate sort order but
-- can not be found in the group-by list
-CREATE TABLE t1 (c1 int PRIMARY KEY, c2 int);
-CREATE UNIQUE INDEX ON t1(c2);
+CREATE TABLE agg_sort_order (c1 int PRIMARY KEY, c2 int);
+CREATE UNIQUE INDEX ON agg_sort_order(c2);
explain (costs off)
SELECT array_agg(c1 ORDER BY c2),c2
-FROM t1 WHERE c2 < 100 GROUP BY c1 ORDER BY 2;
- QUERY PLAN
---------------------------------------------------------
+FROM agg_sort_order WHERE c2 < 100 GROUP BY c1 ORDER BY 2;
+ QUERY PLAN
+--------------------------------------------------------------------
Sort
Sort Key: c2
-> GroupAggregate
Group Key: c1
-> Sort
Sort Key: c1, c2
- -> Bitmap Heap Scan on t1
+ -> Bitmap Heap Scan on agg_sort_order
Recheck Cond: (c2 < 100)
- -> Bitmap Index Scan on t1_c2_idx
+ -> Bitmap Index Scan on agg_sort_order_c2_idx
Index Cond: (c2 < 100)
(10 rows)
-DROP TABLE t1 CASCADE;
+DROP TABLE agg_sort_order CASCADE;
-- Check, that GROUP-BY reordering optimization can operate with pathkeys, built
-- by planner itself. For example, by MergeJoin.
SET enable_hashjoin = off;
diff --git a/src/test/regress/sql/aggregates.sql b/src/test/regress/sql/aggregates.sql
index 524bdfa67d6..c2b3e162267 100644
--- a/src/test/regress/sql/aggregates.sql
+++ b/src/test/regress/sql/aggregates.sql
@@ -1233,12 +1233,12 @@ DROP TABLE btg;
-- The case, when scanning sort order correspond to aggregate sort order but
-- can not be found in the group-by list
-CREATE TABLE t1 (c1 int PRIMARY KEY, c2 int);
-CREATE UNIQUE INDEX ON t1(c2);
+CREATE TABLE agg_sort_order (c1 int PRIMARY KEY, c2 int);
+CREATE UNIQUE INDEX ON agg_sort_order(c2);
explain (costs off)
SELECT array_agg(c1 ORDER BY c2),c2
-FROM t1 WHERE c2 < 100 GROUP BY c1 ORDER BY 2;
-DROP TABLE t1 CASCADE;
+FROM agg_sort_order WHERE c2 < 100 GROUP BY c1 ORDER BY 2;
+DROP TABLE agg_sort_order CASCADE;
-- Check, that GROUP-BY reordering optimization can operate with pathkeys, built
-- by planner itself. For example, by MergeJoin.