-
Notifications
You must be signed in to change notification settings - Fork 5.9k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
planner: generate IndexMergePath in physical optimization (#10512)
- Loading branch information
Showing
8 changed files
with
291 additions
and
11 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,141 @@ | ||
| // Copyright 2019 PingCAP, Inc. | ||
| // | ||
| // Licensed under the Apache License, Version 2.0 (the "License"); | ||
| // you may not use this file except in compliance with the License. | ||
| // You may obtain a copy of the License at | ||
| // | ||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
| // | ||
| // Unless required by applicable law or agreed to in writing, software | ||
| // distributed under the License is distributed on an "AS IS" BASIS, | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| package core | ||
|
|
||
| import ( | ||
| . "github.com/pingcap/check" | ||
| "github.com/pingcap/parser" | ||
| "github.com/pingcap/parser/ast" | ||
| "github.com/pingcap/parser/model" | ||
| "github.com/pingcap/tidb/infoschema" | ||
| "github.com/pingcap/tidb/sessionctx" | ||
| "github.com/pingcap/tidb/util/testleak" | ||
| ) | ||
|
|
||
| var _ = Suite(&testIndexMergeSuite{}) | ||
|
|
||
| type testIndexMergeSuite struct { | ||
| *parser.Parser | ||
|
|
||
| is infoschema.InfoSchema | ||
| ctx sessionctx.Context | ||
| } | ||
|
|
||
| func (s *testIndexMergeSuite) SetUpSuite(c *C) { | ||
| s.is = infoschema.MockInfoSchema([]*model.TableInfo{MockTable(), MockView()}) | ||
| s.ctx = MockContext() | ||
| s.Parser = parser.New() | ||
| } | ||
|
|
||
| func getIndexMergePathDigest(paths []*accessPath, startIndex int) string { | ||
| if len(paths) == startIndex { | ||
| return "[]" | ||
| } | ||
| idxMergeDisgest := "[" | ||
| for i := startIndex; i < len(paths); i++ { | ||
| if i != startIndex { | ||
| idxMergeDisgest += "," | ||
| } | ||
| path := paths[i] | ||
| idxMergeDisgest += "{Idxs:[" | ||
| for j := 0; j < len(path.partialIndexPaths); j++ { | ||
| if j > 0 { | ||
| idxMergeDisgest += "," | ||
| } | ||
| idxMergeDisgest += path.partialIndexPaths[j].index.Name.L | ||
| } | ||
| idxMergeDisgest += "],TbFilters:[" | ||
| for j := 0; j < len(path.tableFilters); j++ { | ||
| if j > 0 { | ||
| idxMergeDisgest += "," | ||
| } | ||
| idxMergeDisgest += path.tableFilters[j].String() | ||
| } | ||
| idxMergeDisgest += "]}" | ||
| } | ||
| idxMergeDisgest += "]" | ||
| return idxMergeDisgest | ||
| } | ||
|
|
||
| func (s *testIndexMergeSuite) TestIndexMergePathGenerateion(c *C) { | ||
| defer testleak.AfterTest(c)() | ||
| tests := []struct { | ||
| sql string | ||
| idxMergeDigest string | ||
| }{ | ||
| { | ||
| sql: "select * from t", | ||
| idxMergeDigest: "[]", | ||
| }, | ||
| { | ||
| sql: "select * from t where c < 1", | ||
| idxMergeDigest: "[]", | ||
| }, | ||
| { | ||
| sql: "select * from t where c < 1 or f > 2", | ||
| idxMergeDigest: "[{Idxs:[c_d_e,f_g],TbFilters:[]}]", | ||
| }, | ||
| { | ||
| sql: "select * from t where (c < 1 or f > 2) and (c > 5 or f < 7)", | ||
| idxMergeDigest: "[{Idxs:[c_d_e,f_g],TbFilters:[or(gt(test.t.c, 5), lt(test.t.f, 7))]}," + | ||
| "{Idxs:[c_d_e,f_g],TbFilters:[or(lt(test.t.c, 1), gt(test.t.f, 2))]}]", | ||
| }, | ||
| { | ||
| sql: "select * from t where (c < 1 or f > 2) and (c > 5 or f < 7) and (c < 1 or g > 2)", | ||
| idxMergeDigest: "[{Idxs:[c_d_e,f_g],TbFilters:[or(gt(test.t.c, 5), lt(test.t.f, 7)),or(lt(test.t.c, 1), gt(test.t.g, 2))]}," + | ||
| "{Idxs:[c_d_e,f_g],TbFilters:[or(lt(test.t.c, 1), gt(test.t.f, 2)),or(lt(test.t.c, 1), gt(test.t.g, 2))]}," + | ||
| "{Idxs:[c_d_e,g],TbFilters:[or(lt(test.t.c, 1), gt(test.t.f, 2)),or(gt(test.t.c, 5), lt(test.t.f, 7))]}]", | ||
| }, | ||
| { | ||
| sql: "select * from t where (c < 1 or f > 2) and (c > 5 or f < 7) and (e < 1 or f > 2)", | ||
| idxMergeDigest: "[{Idxs:[c_d_e,f_g],TbFilters:[or(gt(test.t.c, 5), lt(test.t.f, 7)),or(lt(test.t.e, 1), gt(test.t.f, 2))]}," + | ||
| "{Idxs:[c_d_e,f_g],TbFilters:[or(lt(test.t.c, 1), gt(test.t.f, 2)),or(lt(test.t.e, 1), gt(test.t.f, 2))]}]", | ||
| }, | ||
| } | ||
| for i, tc := range tests { | ||
| comment := Commentf("case:%v sql:%s", i, tc.sql) | ||
| stmt, err := s.ParseOneStmt(tc.sql, "", "") | ||
| c.Assert(err, IsNil, comment) | ||
| Preprocess(s.ctx, stmt, s.is) | ||
| builder := &PlanBuilder{ | ||
| ctx: MockContext(), | ||
| is: s.is, | ||
| colMapper: make(map[*ast.ColumnNameExpr]int), | ||
| } | ||
| p, err := builder.Build(stmt) | ||
| if err != nil { | ||
| c.Assert(err.Error(), Equals, tc.idxMergeDigest, comment) | ||
| continue | ||
| } | ||
| c.Assert(err, IsNil) | ||
| p, err = logicalOptimize(builder.optFlag, p.(LogicalPlan)) | ||
| c.Assert(err, IsNil) | ||
| lp := p.(LogicalPlan) | ||
| c.Assert(err, IsNil) | ||
| var ds *DataSource | ||
| for ds == nil { | ||
| switch v := lp.(type) { | ||
| case *DataSource: | ||
| ds = v | ||
| default: | ||
| lp = lp.Children()[0] | ||
| } | ||
| } | ||
| ds.ctx.GetSessionVars().EnableIndexMerge = true | ||
| idxMergeStartIndex := len(ds.possibleAccessPaths) | ||
| _, err = lp.recursiveDeriveStats() | ||
| c.Assert(err, IsNil) | ||
| c.Assert(getIndexMergePathDigest(ds.possibleAccessPaths, idxMergeStartIndex), Equals, tc.idxMergeDigest) | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.