planner: do not eliminate group_concat in aggregate elimination

executor/aggregate_test.go

@@ -584,6 +584,7 @@ func (s *testSuite1) TestAggEliminator(c *C) {
 	tk.MustQuery("select min(b) from t").Check(testkit.Rows("-2"))
 	tk.MustQuery("select max(b*b) from t").Check(testkit.Rows("4"))
 	tk.MustQuery("select min(b*b) from t").Check(testkit.Rows("1"))
+	tk.MustQuery("select group_concat(b, b) from t group by a").Check(testkit.Rows("-1-1", "-2-2", "11", "<nil>"))
 }
 
 func (s *testSuite1) TestMaxMinFloatScalaFunc(c *C) {

planner/core/rule_aggregation_elimination.go

@@ -36,6 +36,19 @@ type aggregationEliminateChecker struct {
 // For count(expr), sum(expr), avg(expr), count(distinct expr, [expr...]) we may need to rewrite the expr. Details are shown below.
 // If we can eliminate agg successful, we return a projection. Else we return a nil pointer.
 func (a *aggregationEliminateChecker) tryToEliminateAggregation(agg *LogicalAggregation) *LogicalProjection {
+	for _, af := range agg.AggFuncs {
+		// TODO: Actually, we can rewrite GROUP_CONCAT.
+		// When it accepts only 1 argument, we can extract this argument into a
+		// projection.
+		// When it accepts multiple arguments, we can wrap the arguments with a
+		// function CONCAT_WS and extract this function into a projection.
+		// BUT, GROUP_CONCAT should truncate the final result according to the
+		// system variable `group_concat_max_len`. To ensure the correctness of
+		// the result, we close the elimination of GROUP_CONCAT here.
+		if af.Name == ast.AggFuncGroupConcat {
+			return nil
+		}
+	}
 	schemaByGroupby := expression.NewSchema(agg.groupByCols...)
 	coveredByUniqueKey := false
 	for _, key := range agg.children[0].Schema().Keys {