1
0
mirror of https://github.com/mariadb-corporation/mariadb-columnstore-engine.git synced 2025-07-30 19:23:07 +03:00

MCOL-4530: common conjuction top rewrite (#2673)

Added logical transformation of the execplan::ParseTrees with the taking out the common factor in expression of the form "(A and B) or (A and C)" for the purposes of passing a TPCH 19 query.

Co-authored-by: Leonid Fedorov <leonid.fedorov@mariadb.com>
This commit is contained in:
Andrey Piskunov
2023-02-27 18:23:19 +02:00
committed by GitHub
parent 8671f55784
commit b6808c97f1
18 changed files with 6097 additions and 23 deletions

40
dbcon/execplan/rewrites.h Normal file
View File

@ -0,0 +1,40 @@
/* Copyright (C) 2022 MariaDB Corporation
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; version 2 of
the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA. */
#pragma once
#include <parsetree.h>
#include <treenode.h>
#include <simplefilter.h>
namespace execplan
{
#define debug_rewrites false
execplan::OpType oppositeOperator(execplan::OpType op);
struct NodeSemanticComparator
{
bool operator()(execplan::ParseTree* left, execplan::ParseTree* right) const;
};
// Walk the tree and find out common conjuctions
template<bool stableSort = false>
execplan::ParseTree* extractCommonLeafConjunctionsToRoot(execplan::ParseTree* tree);
} // namespace execplan