DataFusion is an extensible query execution framework that uses Apache Arrow as its in-memory format.
DataFusion supports both an SQL and a DataFrame API for building logical query plans as well as a query optimizer and execution engine capable of parallel execution against partitioned data sources (CSV and Parquet) using threads.
Below is an example of how to execute a query against data stored
in a CSV file using a DataFrame:
# use *;
# use Result;
# use RecordBatch;
#
# async
and how to execute a query against a CSV using SQL:
# use *;
# use Result;
# use RecordBatch;
#
# async
Parse, Plan, Optimize, Execute
DataFusion is a fully fledged query engine capable of performing complex operations. Specifically, when DataFusion receives an SQL query, there are different steps that it passes through until a result is obtained. Broadly, they are:
- The string is parsed to an Abstract syntax tree (AST) using sqlparser.
- The planner
SqlToRelconverts logical expressions on the AST to logical expressionsExprs. - The planner
SqlToRelconverts logical nodes on the AST to aLogicalPlan. OptimizerRulesare applied to theLogicalPlanto optimize it.- The
LogicalPlanis converted to anExecutionPlanby aPhysicalPlanner - The
ExecutionPlanis executed against data through theExecutionContext
With a DataFrame API, steps 1-3 are not used as the DataFrame builds the LogicalPlan directly.
Phases 1-5 are typically cheap when compared to phase 6, and thus DataFusion puts a lot of effort to ensure that phase 6 runs efficiently and without errors.
DataFusion's planning is divided in two main parts: logical planning and physical planning.
Logical plan
Logical planning yields logical plans and logical expressions.
These are Schema-aware traits that represent statements whose result is independent of how it should physically be executed.
A LogicalPlan is a Direct Asyclic graph of other LogicalPlans and each node contains logical expressions (Exprs).
All of these are located in logical_plan.
Physical plan
A Physical plan (ExecutionPlan) is a plan that can be executed against data.
Contrarily to a logical plan, the physical plan has concrete information about how the calculation
should be performed (e.g. what Rust functions are used) and how data should be loaded into memory.
ExecutionPlan uses the Arrow format as its in-memory representation of data, through the [arrow] crate.
We recommend going through its documentation for details on how the data is physically represented.
A ExecutionPlan is composed by nodes (implement the trait ExecutionPlan),
and each node is composed by physical expressions (PhysicalExpr)
or aggreagate expressions (AggregateExpr).
All of these are located in the module physical_plan.
Broadly speaking,
- an
ExecutionPlanreceives a partition number and asyncronosly returns an iterator overRecordBatch(a node-specific struct that implementsRecordBatchReader) - a
PhysicalExprreceives aRecordBatchand returns anArray - an
AggregateExprreceivesRecordBatches and returns aRecordBatchof a single row(*)
(*) Technically, it aggregates the results on each partition and then merges the results into a single partition.
The following physical nodes are currently implemented:
- Projection:
ProjectionExec - Filter:
FilterExec - Hash and Grouped aggregations:
HashAggregateExec - Sort:
SortExec - Merge (partitions):
MergeExec - Limit:
LocalLimitExecandGlobalLimitExec - Scan a CSV:
CsvExec - Scan a Parquet:
ParquetExec - Scan from memory:
MemoryExec - Explain the plan:
ExplainExec
Customize
DataFusion allows users to
- extend the planner to use user-defined logical and physical nodes (
QueryPlanner) - declare and use user-defined scalar functions (
ScalarUDF) - declare and use user-defined aggregate functions (
AggregateUDF)
you can find examples of each of them in examples section.