When I first started writing SQLGlot in early 2021, my goal was just to translate SQL queries from SparkSQL to Presto and vice versa. However, over the last year and a half, I've ended up with a full-fledged SQL engine. SQLGlot can now parse and transpile between 18 SQL dialects and can execute all 24 TPC-H SQL queries. The parser and engine are all written from scratch using Python.
This post will cover why I went through the effort of creating a Python SQL engine and how a simple query goes from a string to actually transforming data. The following steps are briefly summarized:
I started working on SQLGlot because of my work on the experimentation and metrics platform at Netflix, where I built tools that allowed data scientists to define and compute SQL-based metrics. Netflix relied on multiple engines to query data (Spark, Presto, and Druid), so my team built the metrics platform around PyPika, a Python SQL query builder. This way, definitions could be reused across multiple engines. However, it became quickly apparent that writing python code to programmatically generate SQL was challenging for data scientists, especially those with academic backgrounds, since they were mostly familiar with R and SQL. At the time, the only Python SQL parser was sqlparse, which is not actually a parser but a tokenizer, so having users write raw SQL into the platform wasn't really an option. Some time later, I randomly stumbled across Crafting Interpreters and realized that I could use it as a guide towards creating my own SQL parser/transpiler.
Why did I do this? Isn't a Python SQL engine going to be extremely slow?
The main reason why I ended up building a SQL engine was...just for entertainment. It's been fun learning about all the things required to actually run a SQL query, and seeing it actually work is extremely rewarding. Before SQLGlot, I had zero experience with lexers, parsers, or compilers.
In terms of practical use cases, I planned to use the Python SQL engine for unit testing SQL pipelines. Big data pipelines are tough to test because many of the engines are not open source and cannot be run locally. With SQLGlot, you can take a SQL query targeting a warehouse such as Snowflake and seamlessly run it in CI on mock Python data. It's easy to mock data and create arbitrary UDFs because everything is just Python. Although the implementation is slow and unsuitable for large amounts of data (> 1 million rows), there's very little overhead/startup and you can run queries on test data in a couple of milliseconds.
Finally, the components that have been built to support execution can be used as a foundation for a faster engine. I'm inspired by what Apache Calcite has done for the JVM world. Even though Python is commonly used for data, there hasn't been a Calcite for Python. So, you could say that SQLGlot aims to be that framework. For example, it wouldn't take much work to replace the Python execution engine with numpy/pandas/arrow to become a respectably-performing query engine. The implementation would be able to leverage the parser, optimizer, and logical planner, only needing to implement physical execution. There is a lot of work in the Python ecosystem around high performance vectorized computation, which I think could benefit from a pure Python-based AST/plan. Parsing and planning doesn't have to be fast when the bottleneck of running queries is processing terabytes of data. So, having a Python-based ecosystem around SQL is beneficial given the ease of development in Python, despite not having bare metal performance.
Parts of SQLGlot's toolkit are being used today by the following:
- Ibis: A Python library that provides a lightweight, universal interface for data wrangling.
- Uses the Python SQL expression builder and leverages the optimizer/planner to convert SQL into dataframe operations.
- mysql-mimic: Pure-Python implementation of the MySQL server wire protocol
- Parses / transforms SQL and executes INFORMATION_SCHEMA queries.
- Quokka: Push-based vectorized query engine
- Parse and optimizes SQL.
- Splink: Fast, accurate and scalable probabilistic data linkage using your choice of SQL backend.
- Transpiles queries.
There are many steps involved with actually running a simple query like:
SELECT
bar.a,
b + 1 AS b
FROM bar
JOIN baz
ON bar.a = baz.a
WHERE bar.a > 1In this post, I'll walk through all the steps SQLGlot takes to run this query over Python objects.
The first step is to convert the sql string into a list of tokens. SQLGlot's tokenizer is quite simple and can be found here. In a while loop, it checks each character and either appends the character to the current token, or makes a new token.
Running the SQLGlot tokenizer shows the output.
Each keyword has been converted to a SQLGlot Token object. Each token has some metadata associated with it, like line/column information for error messages. Comments are also a part of the token, so that comments can be preserved.
Once a SQL statement is tokenized, we don't need to worry about white space and other formatting, so it's easier to work with. We can now convert the list of tokens into an AST. The SQLGlot parser is a handwritten recursive descent parser.
Similar to the tokenizer, it consumes the tokens sequentially, but it instead uses a recursive algorithm. The tokens are converted into a single AST node that presents the SQL query. The SQLGlot parser was designed to support various dialects, so it contains many options for overriding parsing functionality.
The AST is a generic representation of a given SQL query. Each dialect can override or implement its own generator, which can convert an AST object into syntatically-correct SQL.
Once we have our AST, we can transform it into an equivalent query that produces the same results more efficiently. When optimizing queries, most engines first convert the AST into a logical plan and then optimize the plan. However, I chose to optimize the AST directly for the following reasons:
-
It's easier to debug and validate the optimizations when the input and output are both SQL.
-
Rules can be applied a la carte to transform SQL into a more desirable form.
-
I wanted a way to generate 'canonical sql'. Having a canonical representation of SQL is useful for understanding if two queries are semantically equivalent (e.g.
SELECT 1 + 1andSELECT 2).
I've yet to find another engine that takes this approach, but I'm quite happy with this decision. The optimizer currently does not perform any "physical optimizations" such as join reordering. Those are left to the execution layer, as additional statistics and information could become relevant.
The optimizer currently has 17 rules. Each of these rules is applied, transforming the AST in place. The combination of these rules creates "canonical" sql that can then be more easily converted into a logical plan and executed.
Some example rules are:
- Adds all db/catalog qualifiers to tables and forces an alias.
- Ensure each column is unambiguous and expand stars.
SELECT * FROM x;
SELECT "db"."x" AS "x";Boolean and math simplification. Check out all the test cases.
((NOT FALSE) AND (x = x)) AND (TRUE OR 1 <> 3);
x = x;
1 + 1;
2;Attempts to convert all predicates into conjunctive normal form.
-- DNF
(A AND B) OR (B AND C AND D);
-- CNF
(A OR C) AND (A OR D) AND B;Converts subqueries in predicates into joins.
-- The subquery can be converted into a left join
SELECT *
FROM x AS x
WHERE (
SELECT y.a AS a
FROM y AS y
WHERE x.a = y.a
) = 1;
SELECT *
FROM x AS x
LEFT JOIN (
SELECT y.a AS a
FROM y AS y
WHERE TRUE
GROUP BY y.a
) AS "_u_0"
ON x.a = "_u_0".a
WHERE ("_u_0".a = 1 AND NOT "_u_0".a IS NULL)Push down filters into the innermost query.
SELECT *
FROM (
SELECT *
FROM x AS x
) AS y
WHERE y.a = 1;
SELECT *
FROM (
SELECT *
FROM x AS x
WHERE y.a = 1
) AS y WHERE TRUEInfer all types throughout the AST given schema information and function type definitions.
After the SQL AST has been "optimized", it's much easier to convert into a logical plan. The AST is traversed and converted into a DAG consisting of one of five steps. The different steps are:
Selects columns from a table, applies projections, and finally filters the table.
Sorts a table for order by expressions.
Applies the operators union/union all/except/intersect.
Applies an aggregation/group by.
Joins multiple tables together.
The logical plan is quite simple and contains the information required to convert it into a physical plan (execution).
Finally, we can actually execute the SQL query. The Python engine is not fast, but it's very small (~400 LOC)! It iterates the DAG with a queue and runs each step, passing each intermediary table to the next step.
In order to keep things simple, it evaluates expressions with eval. Because SQLGlot was built primarily to be a transpiler, it was simple to create a "Python SQL" dialect. So a SQL expression x + 1 can just be converted into scope['x'] + 1.
SQLGlot's main focus will always be on parsing/transpiling, but I plan to continue development on the execution engine. I'd like to pass TPC-DS. If someone doesn't beat me to it, I may even take a stab at writing a Pandas/Arrow execution engine.
I'm hoping that over time, SQLGlot will spark the Python SQL ecosystem just like Calcite has for Java.
SQLGlot would not be what it is without it's core contributors. In particular, the execution engine would not exist without Barak Alon and George Sittas.
If you'd like to chat more about SQLGlot, please join my Slack Channel!