This is an automated email from the ASF dual-hosted git repository.
jiafengzheng pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/doris-website.git
The following commit(s) were added to refs/heads/master by this push:
new 0e83b9de17e fix
0e83b9de17e is described below
commit 0e83b9de17ecb26c7f71f4ad2ed3cf7418c82560
Author: jiafeng.zhang <[email protected]>
AuthorDate: Sat Aug 27 16:05:52 2022 +0800
fix
---
blog/principle-of-Doris-SQL-parsing.md | 7 ++-----
1 file changed, 2 insertions(+), 5 deletions(-)
diff --git a/blog/principle-of-Doris-SQL-parsing.md
b/blog/principle-of-Doris-SQL-parsing.md
index bc76cda6b7f..4161aedf4ac 100644
--- a/blog/principle-of-Doris-SQL-parsing.md
+++ b/blog/principle-of-Doris-SQL-parsing.md
@@ -73,7 +73,7 @@ The syntax analysis will convert the token generated by the
lexical analysis int
## 2.3 Logical plan
The logical plan converts the abstract syntax tree into an algebraic relation,
which is an operator tree, and each node represents a calculation method for
data. The entire tree represents the calculation method and flows direction of
data, as shown in Figure 3.
-
+

## 2.4 Physical plan
@@ -159,10 +159,7 @@ As shown in Figure 8, for unoptimized relational algebra,
all columns need to be
When Doris generates algebraic relations, a lot of optimizations are made: the
projection columns and query conditions will be put into the scan operation as
much as possible.
-<div align=center>
-<img alt="Figure8 Unoptimized relational algebra" width="20%"
src="../static/images/blogs/principle-of-Doris-SQL-parsing/Figure_8_en.png"/>
-</div>
- <p align="center">Figure8 Unoptimized relational algebra</p>
+
**Specifically, this phase mainly does the following tasks:**
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]