-
Notifications
You must be signed in to change notification settings - Fork 14
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
10 changed files
with
43 additions
and
126 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
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 |
---|---|---|
@@ -1,16 +1,15 @@ | ||
use petgraph::stable_graph::{StableDiGraph, NodeIndex}; | ||
use petgraph::stable_graph::{NodeIndex, StableDiGraph}; | ||
|
||
use super::opt_expr::OptExprNodeId; | ||
|
||
|
||
pub type HepNodeId = NodeIndex<OptExprNodeId>; | ||
|
||
pub struct HepNode { | ||
id: HepNodeId, | ||
// plan: | ||
// plan: | ||
} | ||
|
||
pub struct HepGraph { | ||
graph: StableDiGraph<HepNode, usize, usize>, | ||
root: HepNodeId, | ||
} | ||
} |
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 |
---|---|---|
@@ -1,3 +1 @@ | ||
pub struct HepMatcher { | ||
|
||
} | ||
pub struct HepMatcher {} |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -12,4 +12,4 @@ pub enum OptExprNode { | |
pub struct OptExpr { | ||
pub root: OptExprNode, | ||
pub children: Vec<OptExpr>, | ||
} | ||
} |
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 |
---|---|---|
|
@@ -11,4 +11,4 @@ pub enum PatternChildrenPredicate { | |
MatchedRecursive, | ||
Predicate(Vec<Pattern>), | ||
None, | ||
} | ||
} |
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 |
---|---|---|
@@ -1,8 +1,11 @@ | ||
use std::fmt::Debug; | ||
|
||
use super::{pattern::Pattern, graph::{HepGraph, HepNodeId}}; | ||
use super::{ | ||
graph::{HepGraph, HepNodeId}, | ||
pattern::Pattern, | ||
}; | ||
|
||
pub trait Rule: Debug { | ||
fn pattern(&self) -> &Pattern; | ||
fn apply(&self, node_id: HepNodeId, graph: &mut HepGraph) -> bool; | ||
} | ||
} |
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 |
---|---|---|
@@ -1,125 +1,37 @@ | ||
use std::sync::Arc; | ||
|
||
use crate::planner::{logical_plan::{LogicalPlan, self}, operator::LogicalOperator}; | ||
use crate::planner::{ | ||
logical_plan::{self, LogicalPlan}, | ||
operator::LogicalOperator, | ||
}; | ||
|
||
use self::{physical_plan::PhysicalPlan, heuristic::HepOptimizer, physical_optimizer::PhysicalOptimizer}; | ||
use self::{ | ||
heuristic::HepOptimizer, physical_optimizer::PhysicalOptimizer, physical_plan::PhysicalPlan, | ||
}; | ||
|
||
pub mod heuristic; | ||
pub mod operator; | ||
pub mod physical_optimizer; | ||
pub mod physical_plan; | ||
pub mod heuristic; | ||
pub mod rule; | ||
pub mod physical_optimizer; | ||
|
||
pub struct Optimizer { | ||
hep_optimizer: HepOptimizer, | ||
physical_optimizer: PhysicalOptimizer, | ||
} | ||
impl Optimizer { | ||
pub fn new() -> Self { | ||
Self { hep_optimizer: HepOptimizer::default(), physical_optimizer: PhysicalOptimizer {}} | ||
Self { | ||
hep_optimizer: HepOptimizer::default(), | ||
physical_optimizer: PhysicalOptimizer {}, | ||
} | ||
} | ||
|
||
pub fn find_best(&self, logical_plan: LogicalPlan) -> PhysicalPlan { | ||
// find best logical plan | ||
// optimize logical plan | ||
let optimized_logical_plan = self.hep_optimizer.find_best(logical_plan); | ||
|
||
// TODO find best physical plan | ||
self.physical_optimizer.find_best(Arc::new(optimized_logical_plan)) | ||
|
||
// let physical_node = Self::build_physical_node( | ||
// self.logical_plan.clone(), | ||
// self.logical_plan.children.clone(), | ||
// ); | ||
// TODO 递归 | ||
// Self::build_physical_plan(physical_node, self.logical_plan.clone()) | ||
} | ||
|
||
fn build_physical_plan( | ||
mut physical_plan: PhysicalPlan, | ||
logical_plan: Arc<LogicalPlan>, | ||
) -> PhysicalPlan { | ||
for logical_child in logical_plan.children.iter() { | ||
let physical_child = | ||
Self::build_physical_node(logical_child.clone(), logical_child.children.clone()); | ||
physical_plan | ||
.children | ||
.push(Arc::new(Self::build_physical_plan( | ||
physical_child, | ||
logical_child.clone(), | ||
))); | ||
} | ||
physical_plan | ||
} | ||
|
||
fn build_physical_node( | ||
logical_node: Arc<LogicalPlan>, | ||
logical_node_children: Vec<Arc<LogicalPlan>>, | ||
) -> PhysicalPlan { | ||
match logical_node.operator { | ||
LogicalOperator::Dummy => PhysicalPlan::dummy(), | ||
LogicalOperator::CreateTable(ref logic_create_table) => { | ||
PhysicalPlan::new_create_table_node( | ||
&logic_create_table.table_name, | ||
&logic_create_table.schema, | ||
) | ||
} | ||
LogicalOperator::Insert(ref logic_insert) => { | ||
PhysicalPlan::new_insert_node(&logic_insert.table_name, &logic_insert.columns) | ||
} | ||
LogicalOperator::Values(ref logical_values) => { | ||
PhysicalPlan::new_values_node(&logical_values.columns, &logical_values.tuples) | ||
} | ||
LogicalOperator::Project(ref logical_project) => { | ||
PhysicalPlan::new_project_node(&logical_project.expressions) | ||
} | ||
LogicalOperator::Filter(ref logical_filter) => { | ||
// filter下只有一个子节点 | ||
let child_logical_node = logical_node_children[0].clone(); | ||
let child_physical_node = Self::build_physical_node( | ||
child_logical_node.clone(), | ||
child_logical_node.children.clone(), | ||
); | ||
PhysicalPlan::new_filter_node( | ||
&logical_filter.predicate, | ||
child_physical_node.operator.clone(), | ||
) | ||
} | ||
LogicalOperator::Scan(ref logical_table_scan) => PhysicalPlan::new_table_scan_node( | ||
&logical_table_scan.table_oid, | ||
&logical_table_scan.columns, | ||
), | ||
LogicalOperator::Limit(ref logical_limit) => { | ||
// limit下只有一个子节点 | ||
let child_logical_node = logical_node_children[0].clone(); | ||
let child_physical_node = Self::build_physical_node( | ||
child_logical_node.clone(), | ||
child_logical_node.children.clone(), | ||
); | ||
PhysicalPlan::new_limit_node( | ||
&logical_limit.limit, | ||
&logical_limit.offset, | ||
child_physical_node.operator.clone(), | ||
) | ||
} | ||
LogicalOperator::Join(ref logical_join) => { | ||
let left_logical_node = logical_node_children[0].clone(); | ||
let right_logical_node = logical_node_children[1].clone(); | ||
let left_physical_node = Self::build_physical_node( | ||
left_logical_node.clone(), | ||
left_logical_node.children.clone(), | ||
); | ||
let right_physical_node = Self::build_physical_node( | ||
right_logical_node.clone(), | ||
right_logical_node.children.clone(), | ||
); | ||
PhysicalPlan::new_nested_loop_join_node( | ||
logical_join.join_type, | ||
logical_join.condition.clone(), | ||
left_physical_node.operator.clone(), | ||
right_physical_node.operator.clone(), | ||
) | ||
} | ||
_ => unimplemented!(), | ||
} | ||
// optimize physical plan | ||
self.physical_optimizer.find_best(optimized_logical_plan) | ||
} | ||
} |
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
|